Base | Representation |
---|---|
bin | 1001011000001000001100… |
… | …1011011011010011100001 |
3 | 1100111122020011002110201202 |
4 | 2112002003023123103201 |
5 | 2322410112303233441 |
6 | 33532223234410545 |
7 | 2112611304521150 |
oct | 226020313332341 |
9 | 40448204073652 |
10 | 10310122321121 |
11 | 33155532a1a67 |
12 | 11a6207130a55 |
13 | 59a318101b4c |
14 | 279026755597 |
15 | 12d2cb0c319b |
hex | 960832db4e1 |
10310122321121 has 32 divisors (see below), whose sum is σ = 12336592204800. Its totient is φ = 8429780620800.
The previous prime is 10310122321111. The next prime is 10310122321139. The reversal of 10310122321121 is 12112322101301.
It is not a de Polignac number, because 10310122321121 - 222 = 10310118126817 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10310122321093 and 10310122321102.
It is not an unprimeable number, because it can be changed into a prime (10310122321111) 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 31 ways as a sum of consecutive naturals, for example, 8949845 + ... + 10035933.
It is an arithmetic number, because the mean of its divisors is an integer number (385518506400).
Almost surely, 210310122321121 is an apocalyptic number.
It is an amenable number.
10310122321121 is a deficient number, since it is larger than the sum of its proper divisors (2026469883679).
10310122321121 is a wasteful number, since it uses less digits than its factorization.
10310122321121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1086689.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 10310122321121 its reverse (12112322101301), we get a palindrome (22422444422422).
The spelling of 10310122321121 in words is "ten trillion, three hundred ten billion, one hundred twenty-two million, three hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •