Base | Representation |
---|---|
bin | 1001010110000111100… |
… | …01000100011000010111 |
3 | 1010200211211212202020220 |
4 | 10223003301010120113 |
5 | 20230114133000043 |
6 | 403303344325423 |
7 | 32125311651663 |
oct | 4530361043027 |
9 | 1120754782226 |
10 | 321112000023 |
11 | 114201397401 |
12 | 52297913873 |
13 | 243859c9209 |
14 | 11782dab8a3 |
15 | 8545d81483 |
hex | 4ac3c44617 |
321112000023 has 16 divisors (see below), whose sum is σ = 442942305120. Its totient is φ = 206679154304.
The previous prime is 321112000021. The next prime is 321112000031. The reversal of 321112000023 is 320000211123.
It is a cyclic number.
It is not a de Polignac number, because 321112000023 - 21 = 321112000021 is a prime.
It is a super-2 number, since 2×3211120000232 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 321111999966 and 321112000011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321112000021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1300465 + ... + 1527557.
It is an arithmetic number, because the mean of its divisors is an integer number (27683894070).
Almost surely, 2321112000023 is an apocalyptic number.
321112000023 is a deficient number, since it is larger than the sum of its proper divisors (121830305097).
321112000023 is a wasteful number, since it uses less digits than its factorization.
321112000023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243378.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 321112000023 its reverse (320000211123), we get a palindrome (641112211146).
The spelling of 321112000023 in words is "three hundred twenty-one billion, one hundred twelve million, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •