Base | Representation |
---|---|
bin | 1101101111010010011100… |
… | …00101011010001110000111 |
3 | 10221222020201220002020101020 |
4 | 12313221032011122032013 |
5 | 12424443400130013111 |
6 | 144131130212402223 |
7 | 6235516151554530 |
oct | 667511605321607 |
9 | 127866656066336 |
10 | 30212110001031 |
11 | 969897a516272 |
12 | 347b386616373 |
13 | 13b1cb36288ba |
14 | 7663b9921687 |
15 | 375d4649b906 |
hex | 1b7a4e15a387 |
30212110001031 has 32 divisors (see below), whose sum is σ = 46489560961536. Its totient is φ = 17095112112000.
The previous prime is 30212110001009. The next prime is 30212110001039. The reversal of 30212110001031 is 13010001121203.
It is a happy number.
It is not a de Polignac number, because 30212110001031 - 25 = 30212110000999 is a prime.
It is a super-2 number, since 2×302121100010312 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30212110001031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30212110001039) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10643100 + ... + 13179521.
It is an arithmetic number, because the mean of its divisors is an integer number (1452798780048).
Almost surely, 230212110001031 is an apocalyptic number.
30212110001031 is a deficient number, since it is larger than the sum of its proper divisors (16277450960505).
30212110001031 is a wasteful number, since it uses less digits than its factorization.
30212110001031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23823223.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 30212110001031 its reverse (13010001121203), we get a palindrome (43222111122234).
The spelling of 30212110001031 in words is "thirty trillion, two hundred twelve billion, one hundred ten million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •