Base | Representation |
---|---|
bin | 10101100010100011… |
… | …100100000100000001 |
3 | 2012200212000201022112 |
4 | 111202203210010001 |
5 | 334331322421101 |
6 | 14343000145105 |
7 | 1446066350015 |
oct | 254243440401 |
9 | 65625021275 |
10 | 23128326401 |
11 | 9899378a44 |
12 | 4595768195 |
13 | 224783cc4b |
14 | 1195974545 |
15 | 90570c6bb |
hex | 5628e4101 |
23128326401 has 8 divisors (see below), whose sum is σ = 23627906280. Its totient is φ = 22631087232.
The previous prime is 23128326373. The next prime is 23128326409. The reversal of 23128326401 is 10462382132.
It is a Cunningham number, because it is equal to 1520802+1.
It can be written as a sum of positive squares in 4 ways, for example, as 12571791376 + 10556535025 = 112124^2 + 102745^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23128326401 - 226 = 23061217537 is a prime.
It is a super-2 number, since 2×231283264012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (23128326409) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 565196 + ... + 604733.
It is an arithmetic number, because the mean of its divisors is an integer number (2953488285).
Almost surely, 223128326401 is an apocalyptic number.
It is an amenable number.
23128326401 is a deficient number, since it is larger than the sum of its proper divisors (499579879).
23128326401 is a wasteful number, since it uses less digits than its factorization.
23128326401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1170355.
The product of its (nonzero) digits is 13824, while the sum is 32.
The spelling of 23128326401 in words is "twenty-three billion, one hundred twenty-eight million, three hundred twenty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •