Base | Representation |
---|---|
bin | 1110001101000000000001… |
… | …01001010100111110010011 |
3 | 11002120211212101012112222121 |
4 | 13012200000221110332103 |
5 | 13043210202312312243 |
6 | 150232125331115111 |
7 | 6402340115141605 |
oct | 706400051247623 |
9 | 132524771175877 |
10 | 31233013010323 |
11 | 9a51934668453 |
12 | 3605200a42a97 |
13 | 14573503aa397 |
14 | 79d986151175 |
15 | 392697da21ed |
hex | 1c6800a54f93 |
31233013010323 has 16 divisors (see below), whose sum is σ = 33576743808000. Its totient is φ = 28959285281472.
The previous prime is 31233013010291. The next prime is 31233013010359. The reversal of 31233013010323 is 32301031033213.
It is a cyclic number.
It is not a de Polignac number, because 31233013010323 - 25 = 31233013010291 is a prime.
It is a super-2 number, since 2×312330130103232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31233013010383) 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 15 ways as a sum of consecutive naturals, for example, 118350543 + ... + 118614151.
It is an arithmetic number, because the mean of its divisors is an integer number (2098546488000).
Almost surely, 231233013010323 is an apocalyptic number.
31233013010323 is a deficient number, since it is larger than the sum of its proper divisors (2343730797677).
31233013010323 is a wasteful number, since it uses less digits than its factorization.
31233013010323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396354.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 31233013010323 its reverse (32301031033213), we get a palindrome (63534044043536).
The spelling of 31233013010323 in words is "thirty-one trillion, two hundred thirty-three billion, thirteen million, ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •