Base | Representation |
---|---|
bin | 1101101111010000100100… |
… | …11111011110101010010001 |
3 | 10221222011011012210011221112 |
4 | 12313220102133132222101 |
5 | 12424434323202431001 |
6 | 144130443055303105 |
7 | 6235452321451541 |
oct | 667502237365221 |
9 | 127864135704845 |
10 | 30211110202001 |
11 | 969850711a483 |
12 | 347b14781aa95 |
13 | 13b1b8445c041 |
14 | 766322c27321 |
15 | 375cd8809cbb |
hex | 1b7a127dea91 |
30211110202001 has 8 divisors (see below), whose sum is σ = 30218049941760. Its totient is φ = 30204170840592.
The previous prime is 30211110201991. The next prime is 30211110202057. The reversal of 30211110202001 is 10020201111203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30211110202001 is a prime.
It is a super-2 number, since 2×302111102020012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30211110202081) 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, 213120335 + ... + 213262043.
It is an arithmetic number, because the mean of its divisors is an integer number (3777256242720).
Almost surely, 230211110202001 is an apocalyptic number.
It is an amenable number.
30211110202001 is a deficient number, since it is larger than the sum of its proper divisors (6939739759).
30211110202001 is a wasteful number, since it uses less digits than its factorization.
30211110202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189175.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 30211110202001 its reverse (10020201111203), we get a palindrome (40231311313204).
The spelling of 30211110202001 in words is "thirty trillion, two hundred eleven billion, one hundred ten million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •