Base | Representation |
---|---|
bin | 1101101100000101010110… |
… | …01101010011000001100101 |
3 | 10221120201112100201012200011 |
4 | 12312002223031103001211 |
5 | 12421142400304400401 |
6 | 144004400325450221 |
7 | 6224540462315230 |
oct | 666025315230145 |
9 | 127521470635604 |
10 | 30102003200101 |
11 | 965620805a028 |
12 | 3461b77b70971 |
13 | 13a47b6c767a1 |
14 | 760d3249a417 |
15 | 37304ed09451 |
hex | 1b60ab353065 |
30102003200101 has 8 divisors (see below), whose sum is σ = 34418077497920. Its totient is φ = 25789875933888.
The previous prime is 30102003200033. The next prime is 30102003200111. The reversal of 30102003200101 is 10100230020103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30102003200101 - 219 = 30102002675813 is a prime.
It is a super-2 number, since 2×301020032001012 (a number of 28 digits) contains 22 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 (30102003200111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 986741556 + ... + 986772061.
It is an arithmetic number, because the mean of its divisors is an integer number (4302259687240).
Almost surely, 230102003200101 is an apocalyptic number.
It is an amenable number.
30102003200101 is a deficient number, since it is larger than the sum of its proper divisors (4316074297819).
30102003200101 is a wasteful number, since it uses less digits than its factorization.
30102003200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1973515803.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 30102003200101 its reverse (10100230020103), we get a palindrome (40202233220204).
The spelling of 30102003200101 in words is "thirty trillion, one hundred two billion, three million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •