Base | Representation |
---|---|
bin | 1110001100101000000000… |
… | …01111011001101111001111 |
3 | 11002112121120221012102210000 |
4 | 13012110000033121233033 |
5 | 13043002302023442312 |
6 | 150222154205215343 |
7 | 6401402465414112 |
oct | 706240017315717 |
9 | 132477527172700 |
10 | 31220121312207 |
11 | 9a47419634893 |
12 | 3602803561553 |
13 | 1456077597b49 |
14 | 79d0c1d38579 |
15 | 3921911e4adc |
hex | 1c65003d9bcf |
31220121312207 has 10 divisors (see below), whose sum is σ = 46637465170208. Its totient is φ = 20813414208084.
The previous prime is 31220121312181. The next prime is 31220121312253. The reversal of 31220121312207 is 70221312102213.
It is a happy number.
31220121312207 is a `hidden beast` number, since 3 + 1 + 2 + 20 + 121 + 312 + 207 = 666.
It is not a de Polignac number, because 31220121312207 - 236 = 31151401835471 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31220121312007) 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 9 ways as a sum of consecutive naturals, for example, 192716798143 + ... + 192716798304.
Almost surely, 231220121312207 is an apocalyptic number.
31220121312207 is a deficient number, since it is larger than the sum of its proper divisors (15417343858001).
31220121312207 is an equidigital number, since it uses as much as digits as its factorization.
31220121312207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385433596459 (or 385433596450 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The spelling of 31220121312207 in words is "thirty-one trillion, two hundred twenty billion, one hundred twenty-one million, three hundred twelve thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •