Base | Representation |
---|---|
bin | 1101111001001101110001… |
… | …10000111101110001000101 |
3 | 11000011212011012021021111222 |
4 | 12330212320300331301011 |
5 | 13001040424232020401 |
6 | 144551540342410125 |
7 | 6302252555566151 |
oct | 674467060756105 |
9 | 130155135237458 |
10 | 30553202220101 |
11 | 980a5a41509a0 |
12 | 35154b9730945 |
13 | 1408201894c22 |
14 | 778ad6306061 |
15 | 37eb5b48cc1b |
hex | 1bc9b8c3dc45 |
30553202220101 has 8 divisors (see below), whose sum is σ = 33364197129504. Its totient is φ = 27747779155920.
The previous prime is 30553202220083. The next prime is 30553202220103. The reversal of 30553202220101 is 10102220235503.
It is a happy number.
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-30553202220101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30553202220103) 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, 1392949835 + ... + 1392971768.
It is an arithmetic number, because the mean of its divisors is an integer number (4170524641188).
Almost surely, 230553202220101 is an apocalyptic number.
It is an amenable number.
30553202220101 is a deficient number, since it is larger than the sum of its proper divisors (2810994909403).
30553202220101 is a wasteful number, since it uses less digits than its factorization.
30553202220101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2785922611.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 30553202220101 its reverse (10102220235503), we get a palindrome (40655422455604).
The spelling of 30553202220101 in words is "thirty trillion, five hundred fifty-three billion, two hundred two million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •