Base | Representation |
---|---|
bin | 1101101110111110011111… |
… | …10110000111111010111111 |
3 | 10221221020002122100000220101 |
4 | 12313133033312013322333 |
5 | 12424304432421130421 |
6 | 144122155501501531 |
7 | 6234656620300132 |
oct | 667371766077277 |
9 | 127836078300811 |
10 | 30201402130111 |
11 | 9694385176373 |
12 | 34792985718a7 |
13 | 13b0c980a45c4 |
14 | 765a81776219 |
15 | 37591b3b4191 |
hex | 1b77cfd87ebf |
30201402130111 has 8 divisors (see below), whose sum is σ = 31329857181600. Its totient is φ = 29078748904800.
The previous prime is 30201402130103. The next prime is 30201402130129. The reversal of 30201402130111 is 11103120410203.
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 30201402130111 - 23 = 30201402130103 is a prime.
It is a super-3 number, since 3×302014021301113 (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 (30201402130181) 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, 1450445940 + ... + 1450466761.
It is an arithmetic number, because the mean of its divisors is an integer number (3916232147700).
Almost surely, 230201402130111 is an apocalyptic number.
30201402130111 is a deficient number, since it is larger than the sum of its proper divisors (1128455051489).
30201402130111 is a wasteful number, since it uses less digits than its factorization.
30201402130111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2900913089.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 30201402130111 its reverse (11103120410203), we get a palindrome (41304522540314).
The spelling of 30201402130111 in words is "thirty trillion, two hundred one billion, four hundred two million, one hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •