Base | Representation |
---|---|
bin | 1101101110111110000111… |
… | …10011100001000111101101 |
3 | 10221221012120120012212112120 |
4 | 12313133003303201013231 |
5 | 12424304024212322201 |
6 | 144122123444023153 |
7 | 6234651615242220 |
oct | 667370363410755 |
9 | 127835516185476 |
10 | 30201200120301 |
11 | 9694291140411 |
12 | 3479240991ab9 |
13 | 13b0c65295582 |
14 | 765a629cd5b7 |
15 | 3759087ae536 |
hex | 1b77c3ce11ed |
30201200120301 has 8 divisors (see below), whose sum is σ = 46020876373824. Its totient is φ = 17257828640160.
The previous prime is 30201200120297. The next prime is 30201200120327. The reversal of 30201200120301 is 10302100210203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30201200120301 - 22 = 30201200120297 is a prime.
It is a super-2 number, since 2×302012001203012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201200120701) 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, 719076193320 + ... + 719076193361.
It is an arithmetic number, because the mean of its divisors is an integer number (5752609546728).
Almost surely, 230201200120301 is an apocalyptic number.
It is an amenable number.
30201200120301 is a deficient number, since it is larger than the sum of its proper divisors (15819676253523).
30201200120301 is a wasteful number, since it uses less digits than its factorization.
30201200120301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1438152386691.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 30201200120301 its reverse (10302100210203), we get a palindrome (40503300330504).
The spelling of 30201200120301 in words is "thirty trillion, two hundred one billion, two hundred million, one hundred twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •