Base | Representation |
---|---|
bin | 1110000110100001000001… |
… | …01011011000101011101011 |
3 | 11001210112210000000200211211 |
4 | 13003100200223120223223 |
5 | 13031032403300340243 |
6 | 145541521134533551 |
7 | 6350261651630551 |
oct | 703204053305353 |
9 | 131715700020754 |
10 | 31010212121323 |
11 | 99763a2342936 |
12 | 3589ba13672b7 |
13 | 143c334334816 |
14 | 792c8bbb1bd1 |
15 | 38b9a7d4dd9d |
hex | 1c3420ad8aeb |
31010212121323 has 4 divisors (see below), whose sum is σ = 31060309395160. Its totient is φ = 30960114847488.
The previous prime is 31010212121269. The next prime is 31010212121327. The reversal of 31010212121323 is 32312121201013.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31010212121323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31010212121294 and 31010212121303.
It is not an unprimeable number, because it can be changed into a prime (31010212121327) 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, 25048635990 + ... + 25048637227.
It is an arithmetic number, because the mean of its divisors is an integer number (7765077348790).
Almost surely, 231010212121323 is an apocalyptic number.
31010212121323 is a deficient number, since it is larger than the sum of its proper divisors (50097273837).
31010212121323 is an equidigital number, since it uses as much as digits as its factorization.
31010212121323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50097273836.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 31010212121323 its reverse (32312121201013), we get a palindrome (63322333322336).
The spelling of 31010212121323 in words is "thirty-one trillion, ten billion, two hundred twelve million, one hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •