Base | Representation |
---|---|
bin | 1101101110111101110010… |
… | …00101010010110110111111 |
3 | 10221221012010000201112221200 |
4 | 12313132321011102312333 |
5 | 12424303142134343403 |
6 | 144122053540230543 |
7 | 6234644302225011 |
oct | 667367105226677 |
9 | 127835100645850 |
10 | 30201020231103 |
11 | 96941a9643a57 |
12 | 34791b069b453 |
13 | 13b0c36c2cc67 |
14 | 765a46b641b1 |
15 | 3758e7ac8ca3 |
hex | 1b77b9152dbf |
30201020231103 has 24 divisors (see below), whose sum is σ = 43935300957600. Its totient is φ = 19990311633600.
The previous prime is 30201020231089. The next prime is 30201020231113. The reversal of 30201020231103 is 30113202010203.
30201020231103 is a `hidden beast` number, since 302 + 0 + 10 + 20 + 231 + 103 = 666.
It is not a de Polignac number, because 30201020231103 - 24 = 30201020231087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201020231113) 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 23 ways as a sum of consecutive naturals, for example, 1698123 + ... + 7955228.
It is an arithmetic number, because the mean of its divisors is an integer number (1830637539900).
Almost surely, 230201020231103 is an apocalyptic number.
30201020231103 is a deficient number, since it is larger than the sum of its proper divisors (13734280726497).
30201020231103 is a wasteful number, since it uses less digits than its factorization.
30201020231103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9655839 (or 9655836 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 30201020231103 its reverse (30113202010203), we get a palindrome (60314222241306).
The spelling of 30201020231103 in words is "thirty trillion, two hundred one billion, twenty million, two hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •