Base | Representation |
---|---|
bin | 1110001100100111111110… |
… | …00110100010011011111011 |
3 | 11002112121112121021000021212 |
4 | 13012103333012202123323 |
5 | 13043002232131230243 |
6 | 150222152243553335 |
7 | 6401402144151314 |
oct | 706237706423373 |
9 | 132477477230255 |
10 | 31220102211323 |
11 | 9a47409879033 |
12 | 36027b908b84b |
13 | 145607363aa4c |
14 | 79d0bd5a560b |
15 | 39218e6c0318 |
hex | 1c64ff1a26fb |
31220102211323 has 4 divisors (see below), whose sum is σ = 32227202282688. Its totient is φ = 30213002139960.
The previous prime is 31220102211293. The next prime is 31220102211349. The reversal of 31220102211323 is 32311220102213.
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 31220102211323 - 222 = 31220098017019 is a prime.
It is a super-3 number, since 3×312201022113233 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31220102211223) 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, 503550035636 + ... + 503550035697.
It is an arithmetic number, because the mean of its divisors is an integer number (8056800570672).
Almost surely, 231220102211323 is an apocalyptic number.
31220102211323 is a deficient number, since it is larger than the sum of its proper divisors (1007100071365).
31220102211323 is a wasteful number, since it uses less digits than its factorization.
31220102211323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1007100071364.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 31220102211323 its reverse (32311220102213), we get a palindrome (63531322313536).
The spelling of 31220102211323 in words is "thirty-one trillion, two hundred twenty billion, one hundred two million, two hundred eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •