Base | Representation |
---|---|
bin | 1101101110111110010100… |
… | …11111000111100001101111 |
3 | 10221221012212101010202221211 |
4 | 12313133022133013201233 |
5 | 12424304241411304403 |
6 | 144122142530335251 |
7 | 6234654446101333 |
oct | 667371237074157 |
9 | 127835771122854 |
10 | 30201312213103 |
11 | 9694339441399 |
12 | 347927242a527 |
13 | 13b0c82581385 |
14 | 765a7384b7c3 |
15 | 37591355206d |
hex | 1b77ca7c786f |
30201312213103 has 8 divisors (see below), whose sum is σ = 30455901456480. Its totient is φ = 29947441135200.
The previous prime is 30201312213101. The next prime is 30201312213113. The reversal of 30201312213103 is 30131221310203.
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 30201312213103 - 21 = 30201312213101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201312213101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 179456908 + ... + 179625121.
It is an arithmetic number, because the mean of its divisors is an integer number (3806987682060).
Almost surely, 230201312213103 is an apocalyptic number.
30201312213103 is a deficient number, since it is larger than the sum of its proper divisors (254589243377).
30201312213103 is a wasteful number, since it uses less digits than its factorization.
30201312213103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 359082737.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 30201312213103 its reverse (30131221310203), we get a palindrome (60332533523306).
The spelling of 30201312213103 in words is "thirty trillion, two hundred one billion, three hundred twelve million, two hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •