Base | Representation |
---|---|
bin | 1001011000111001000010… |
… | …0100111011101100110111 |
3 | 1100112220001210021211022112 |
4 | 2112032100210323230313 |
5 | 2323113434343404421 |
6 | 33542232144521235 |
7 | 2113554212205413 |
oct | 226162044735467 |
9 | 40486053254275 |
10 | 10323232013111 |
11 | 3320070388656 |
12 | 11a886562021b |
13 | 59b62712b944 |
14 | 27990b8b5d43 |
15 | 12d7e6e9145b |
hex | 9639093bb37 |
10323232013111 has 8 divisors (see below), whose sum is σ = 10444721944800. Its totient is φ = 10202229015840.
The previous prime is 10323232013093. The next prime is 10323232013117. The reversal of 10323232013111 is 11131023232301.
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 10323232013111 - 210 = 10323232012087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10323232013117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 121690955 + ... + 121775756.
It is an arithmetic number, because the mean of its divisors is an integer number (1305590243100).
Almost surely, 210323232013111 is an apocalyptic number.
10323232013111 is a deficient number, since it is larger than the sum of its proper divisors (121489931689).
10323232013111 is a wasteful number, since it uses less digits than its factorization.
10323232013111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243467209.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 10323232013111 its reverse (11131023232301), we get a palindrome (21454255245412).
The spelling of 10323232013111 in words is "ten trillion, three hundred twenty-three billion, two hundred thirty-two million, thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •