Base | Representation |
---|---|
bin | 1101101110111111110100… |
… | …01010001011010111111111 |
3 | 10221221021221010010200202112 |
4 | 12313133322022023113333 |
5 | 12424312411134431312 |
6 | 144122354141244235 |
7 | 6235013330323535 |
oct | 667377212132777 |
9 | 127837833120675 |
10 | 30202112030207 |
11 | 9694709967867 |
12 | 347945626367b |
13 | 13b107c19bc30 |
14 | 765b0bb6a155 |
15 | 37595d88ed22 |
hex | 1b77fa28b5ff |
30202112030207 has 4 divisors (see below), whose sum is σ = 32525351417160. Its totient is φ = 27878872643256.
The previous prime is 30202112030201. The next prime is 30202112030231. The reversal of 30202112030207 is 70203021120203.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30202112030207 - 210 = 30202112029183 is a prime.
It is a super-3 number, since 3×302021120302073 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30202112030201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1161619693457 + ... + 1161619693482.
It is an arithmetic number, because the mean of its divisors is an integer number (8131337854290).
Almost surely, 230202112030207 is an apocalyptic number.
30202112030207 is a deficient number, since it is larger than the sum of its proper divisors (2323239386953).
30202112030207 is a wasteful number, since it uses less digits than its factorization.
30202112030207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2323239386952.
The product of its (nonzero) digits is 1008, while the sum is 23.
The spelling of 30202112030207 in words is "thirty trillion, two hundred two billion, one hundred twelve million, thirty thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •