Base | Representation |
---|---|
bin | 11100000100100010… |
… | …011111000100000111 |
3 | 2212210120110101101000 |
4 | 130010202133010013 |
5 | 443212033420241 |
6 | 21502504304343 |
7 | 2114630410353 |
oct | 340442370407 |
9 | 85716411330 |
10 | 30140920071 |
11 | 118678443a9 |
12 | 5a121720b3 |
13 | 2ac4635162 |
14 | 165d04c463 |
15 | bb61b2eb6 |
hex | 70489f107 |
30140920071 has 16 divisors (see below), whose sum is σ = 45282136320. Its totient is φ = 19810932120.
The previous prime is 30140920067. The next prime is 30140920087. The reversal of 30140920071 is 17002904103.
It is not a de Polignac number, because 30140920071 - 22 = 30140920067 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30140920471) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7859565 + ... + 7863398.
It is an arithmetic number, because the mean of its divisors is an integer number (2830133520).
Almost surely, 230140920071 is an apocalyptic number.
30140920071 is a deficient number, since it is larger than the sum of its proper divisors (15141216249).
30140920071 is a wasteful number, since it uses less digits than its factorization.
30140920071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15723043 (or 15723037 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The spelling of 30140920071 in words is "thirty billion, one hundred forty million, nine hundred twenty thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.250 sec. • engine limits •