Base | Representation |
---|---|
bin | 11100001110101011… |
… | …011010000011100100 |
3 | 2220020102112220201020 |
4 | 130032223122003210 |
5 | 444034110443022 |
6 | 21531422331140 |
7 | 2122064340543 |
oct | 341653320344 |
9 | 86212486636 |
10 | 30311031012 |
11 | 11944872259 |
12 | 5a5b129ab0 |
13 | 2b20955b12 |
14 | 167789015a |
15 | bc60b635c |
hex | 70eada0e4 |
30311031012 has 24 divisors (see below), whose sum is σ = 70734129312. Its totient is φ = 10102478400.
The previous prime is 30311031011. The next prime is 30311031013. The reversal of 30311031012 is 21013011303.
It is an interprime number because it is at equal distance from previous prime (30311031011) and next prime (30311031013).
It is a junction number, because it is equal to n+sod(n) for n = 30311030982 and 30311031000.
It is not an unprimeable number, because it can be changed into a prime (30311031011) 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 7 ways as a sum of consecutive naturals, for example, 41314 + ... + 249657.
It is an arithmetic number, because the mean of its divisors is an integer number (2947255388).
Almost surely, 230311031012 is an apocalyptic number.
It is an amenable number.
30311031012 is an abundant number, since it is smaller than the sum of its proper divisors (40423098300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30311031012 is a wasteful number, since it uses less digits than its factorization.
30311031012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299659 (or 299657 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 30311031012 its reverse (21013011303), we get a palindrome (51324042315).
The spelling of 30311031012 in words is "thirty billion, three hundred eleven million, thirty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •