ℕ atory
Play Now

Properties of the Number 20358

Twenty Thousand Three Hundred Fifty-Eight

Basics

Value: 20357 → 20358 → 20359

Parity: even

Prime: No

Previous Prime: 20357

Next Prime: 20359

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 3 × 13 × 29

Divisors: 1, 2, 3, 6, 9, 13, 18, 26, 27, 29

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 100111110000110

Octal: 47606

Duodecimal: B946

Hexadecimal: 4f86

Square: 414448164

Square Root: 142.68146340712937

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

T(n,k)=Number of length n 0..k arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean. A244903
a(n) = floor( n*(n-1)*(n-2)*(n-3)/28 ). A11938
Numbers whose arithmetic derivatives are a permutation of their digits. A225902
Numbers whose Euler totient function is equal to the product of the number of divisors of their k first powers, for some k. A283759
Number of (n+1) X 5 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock equal to the number in all its horizontal and vertical neighbors. A206263
Number of length n 0..5 arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean. A244900
Number of length 6 0..n arrays with each partial sum starting from the beginning no more than sqrt(2) standard deviations from its mean. A244909
a(n) = n*(n+1)*(n+3). A317637
Triangle T(n,k), read by rows, formed by setting all entries in the zeroth column ((n,0) entries) and the main diagonal ((n,n) entries) to powers of 2 with all other entries formed by the recursion T(n,k) = T(n-1,k) + T(n,k-1). A96466
Numbers k such that the continued fraction for sqrt(k) has period 19. A20358