Base | Representation |
---|---|
bin | 1101101111001110111000… |
… | …11100000010011001010010 |
3 | 10221222001211000100022121110 |
4 | 12313213130130002121102 |
5 | 12424430444023031010 |
6 | 144130213102034150 |
7 | 6235421000252325 |
oct | 667473434023122 |
9 | 127861730308543 |
10 | 30210203330130 |
11 | 969809122419a |
12 | 347ab33b78956 |
13 | 13b1a6b5ca875 |
14 | 7662785dc7bc |
15 | 375c83dc2120 |
hex | 1b79dc702652 |
30210203330130 has 64 divisors (see below), whose sum is σ = 75827640775680. Its totient is φ = 7688396354496.
The previous prime is 30210203330129. The next prime is 30210203330231. The reversal of 30210203330130 is 3103330201203.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30210203330097 and 30210203330106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 49110700 + ... + 49722039.
It is an arithmetic number, because the mean of its divisors is an integer number (1184806887120).
Almost surely, 230210203330130 is an apocalyptic number.
30210203330130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
30210203330130 is an abundant number, since it is smaller than the sum of its proper divisors (45617437445550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30210203330130 is a wasteful number, since it uses less digits than its factorization.
30210203330130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98833215.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 30210203330130 its reverse (3103330201203), we get a palindrome (33313533531333).
The spelling of 30210203330130 in words is "thirty trillion, two hundred ten billion, two hundred three million, three hundred thirty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •