Base | Representation |
---|---|
bin | 1101101111010000101111… |
… | …11010100111001111001111 |
3 | 10221222011101120000102020122 |
4 | 12313220113322213033033 |
5 | 12424440020001413403 |
6 | 144130500105535155 |
7 | 6235454505105206 |
oct | 667502772471717 |
9 | 127864346012218 |
10 | 30211201201103 |
11 | 969855352344a |
12 | 347b1721a44bb |
13 | 13b1b9a270970 |
14 | 766330d5423d |
15 | 375ce17d2838 |
hex | 1b7a17ea73cf |
30211201201103 has 8 divisors (see below), whose sum is σ = 32535182496096. Its totient is φ = 27887226012000.
The previous prime is 30211201201087. The next prime is 30211201201127. The reversal of 30211201201103 is 30110210211203.
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 30211201201103 - 24 = 30211201201087 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 (30211201201003) 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, 18021278 + ... + 19626228.
It is an arithmetic number, because the mean of its divisors is an integer number (4066897812012).
Almost surely, 230211201201103 is an apocalyptic number.
30211201201103 is a deficient number, since it is larger than the sum of its proper divisors (2323981294993).
30211201201103 is a wasteful number, since it uses less digits than its factorization.
30211201201103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3052945.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 30211201201103 its reverse (30110210211203), we get a palindrome (60321411412306).
The spelling of 30211201201103 in words is "thirty trillion, two hundred eleven billion, two hundred one million, two hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •