Base | Representation |
---|---|
bin | 10101110011001001… |
… | …111111110001111000 |
3 | 2020102021002111211120 |
4 | 111303021333301320 |
5 | 340414122234411 |
6 | 14430345425240 |
7 | 1456020554604 |
oct | 256311776170 |
9 | 66367074746 |
10 | 23406836856 |
11 | 9a21604a77 |
12 | 4652a9b220 |
13 | 2290455630 |
14 | 11c0952504 |
15 | 91edc4106 |
hex | 57327fc78 |
23406836856 has 64 divisors (see below), whose sum is σ = 63185001600. Its totient is φ = 7183064448.
The previous prime is 23406836797. The next prime is 23406836861. The reversal of 23406836856 is 65863860432.
It is a junction number, because it is equal to n+sod(n) for n = 23406836799 and 23406836808.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19275 + ... + 217221.
It is an arithmetic number, because the mean of its divisors is an integer number (987265650).
Almost surely, 223406836856 is an apocalyptic number.
23406836856 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23406836856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31592500800).
23406836856 is an abundant number, since it is smaller than the sum of its proper divisors (39778164744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23406836856 is a wasteful number, since it uses less digits than its factorization.
23406836856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198348 (or 198344 counting only the distinct ones).
The product of its (nonzero) digits is 4976640, while the sum is 51.
The spelling of 23406836856 in words is "twenty-three billion, four hundred six million, eight hundred thirty-six thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •