Base | Representation |
---|---|
bin | 1001011000001100010101… |
… | …0100111110110111010011 |
3 | 1100111202002111101012202222 |
4 | 2112003011110332313103 |
5 | 2322414400410403243 |
6 | 33532525321331255 |
7 | 2112650641625156 |
oct | 226030524766723 |
9 | 40452074335688 |
10 | 10311232122323 |
11 | 3315a727a1040 |
12 | 11a6476936b2b |
13 | 59a464004a52 |
14 | 2790cdcc5c9d |
15 | 12d343743168 |
hex | 960c553edd3 |
10311232122323 has 16 divisors (see below), whose sum is σ = 12428139350016. Its totient is φ = 8438860045440.
The previous prime is 10311232122313. The next prime is 10311232122337. The reversal of 10311232122323 is 32322123211301.
It is not a de Polignac number, because 10311232122323 - 28 = 10311232122067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10311232122292 and 10311232122301.
It is not an unprimeable number, because it can be changed into a prime (10311232122313) 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 15 ways as a sum of consecutive naturals, for example, 1198697411 + ... + 1198706012.
It is an arithmetic number, because the mean of its divisors is an integer number (776758709376).
Almost surely, 210311232122323 is an apocalyptic number.
10311232122323 is a deficient number, since it is larger than the sum of its proper divisors (2116907227693).
10311232122323 is a wasteful number, since it uses less digits than its factorization.
10311232122323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2397403474.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 10311232122323 its reverse (32322123211301), we get a palindrome (42633355333624).
The spelling of 10311232122323 in words is "ten trillion, three hundred eleven billion, two hundred thirty-two million, one hundred twenty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •