Base | Representation |
---|---|
bin | 10101011011101001… |
… | …000010001101111011 |
3 | 2012101202201222121201 |
4 | 111123221002031323 |
5 | 334112123220443 |
6 | 14323253515031 |
7 | 1443160331212 |
oct | 253351021573 |
9 | 65352658551 |
10 | 23012320123 |
11 | 9839944791 |
12 | 4562942a77 |
13 | 22297b3a90 |
14 | 11843b8079 |
15 | 8ea44534d |
hex | 55ba4237b |
23012320123 has 8 divisors (see below), whose sum is σ = 24795520848. Its totient is φ = 21230979744.
The previous prime is 23012320103. The next prime is 23012320129. The reversal of 23012320123 is 32102321032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-23012320123 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23012320123.
It is not an unprimeable number, because it can be changed into a prime (23012320129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 439336 + ... + 488917.
It is an arithmetic number, because the mean of its divisors is an integer number (3099440106).
Almost surely, 223012320123 is an apocalyptic number.
23012320123 is a deficient number, since it is larger than the sum of its proper divisors (1783200725).
23012320123 is a wasteful number, since it uses less digits than its factorization.
23012320123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 930173.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 23012320123 its reverse (32102321032), we get a palindrome (55114641155).
Subtracting 23012320123 from its reverse (32102321032), we obtain a palindrome (9090000909).
The spelling of 23012320123 in words is "twenty-three billion, twelve million, three hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •