Base | Representation |
---|---|
bin | 1110001100011010110010… |
… | …00011000011100100101011 |
3 | 11002111221021010022010022101 |
4 | 13012031121003003210223 |
5 | 13042343231424011243 |
6 | 150215021455434231 |
7 | 6401031523415653 |
oct | 706153103034453 |
9 | 132457233263271 |
10 | 31213021313323 |
11 | 9a4440589a613 |
12 | 3601361825977 |
13 | 14554b564ba85 |
14 | 79ca0adcb363 |
15 | 391dc7c2654d |
hex | 1c63590c392b |
31213021313323 has 4 divisors (see below), whose sum is σ = 31213427931400. Its totient is φ = 31212614695248.
The previous prime is 31213021313321. The next prime is 31213021313351. The reversal of 31213021313323 is 32331312031213.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31213021313323 - 21 = 31213021313321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31213021313291 and 31213021313300.
It is not an unprimeable number, because it can be changed into a prime (31213021313321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 203193873 + ... + 203347426.
It is an arithmetic number, because the mean of its divisors is an integer number (7803356982850).
Almost surely, 231213021313323 is an apocalyptic number.
31213021313323 is a deficient number, since it is larger than the sum of its proper divisors (406618077).
31213021313323 is an equidigital number, since it uses as much as digits as its factorization.
31213021313323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406618076.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 31213021313323 its reverse (32331312031213), we get a palindrome (63544333344536).
The spelling of 31213021313323 in words is "thirty-one trillion, two hundred thirteen billion, twenty-one million, three hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •