Base | Representation |
---|---|
bin | 1001000101011000111… |
… | …01010100011000011001 |
3 | 1002211122221120021221100 |
4 | 10202230131110120121 |
5 | 20103221014341441 |
6 | 355220242502013 |
7 | 31356616553535 |
oct | 4425435243031 |
9 | 1084587507840 |
10 | 312131012121 |
11 | 110412901255 |
12 | 505b0064909 |
13 | 235841747a6 |
14 | 11170304bc5 |
15 | 81bc6accb6 |
hex | 48ac754619 |
312131012121 has 48 divisors (see below), whose sum is σ = 477577900800. Its totient is φ = 196104416256.
The previous prime is 312131012093. The next prime is 312131012131. The reversal of 312131012121 is 121210131213.
312131012121 is a `hidden beast` number, since 312 + 1 + 310 + 1 + 21 + 21 = 666.
It is not a de Polignac number, because 312131012121 - 29 = 312131011609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 312131012094 and 312131012103.
It is not an unprimeable number, because it can be changed into a prime (312131012131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 17757225 + ... + 17774793.
It is an arithmetic number, because the mean of its divisors is an integer number (9949539600).
Almost surely, 2312131012121 is an apocalyptic number.
It is an amenable number.
312131012121 is a deficient number, since it is larger than the sum of its proper divisors (165446888679).
312131012121 is a wasteful number, since it uses less digits than its factorization.
312131012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19230 (or 19227 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 312131012121 its reverse (121210131213), we get a palindrome (433341143334).
The spelling of 312131012121 in words is "three hundred twelve billion, one hundred thirty-one million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.570 sec. • engine limits •