Base | Representation |
---|---|
bin | 1101101001001001011010… |
… | …00001110000111111101110 |
3 | 10221020002002101022011110000 |
4 | 12310210231001300333232 |
5 | 12413014224103000420 |
6 | 143450152130525130 |
7 | 6214336163262423 |
oct | 664445501607756 |
9 | 127202071264400 |
10 | 30001102000110 |
11 | 9617439a5204a |
12 | 34464b84367a6 |
13 | 1398126840417 |
14 | 75a0bd889d4a |
15 | 3705e6907690 |
hex | 1b492d070fee |
30001102000110 has 80 divisors (see below), whose sum is σ = 80718141943296. Its totient is φ = 7995482747712.
The previous prime is 30001102000057. The next prime is 30001102000141. The reversal of 30001102000110 is 1100020110003.
It is a super-2 number, since 2×300011020001102 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 30001102000092 and 30001102000101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 9788989 + ... + 12483048.
Almost surely, 230001102000110 is an apocalyptic number.
30001102000110 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
30001102000110 is an abundant number, since it is smaller than the sum of its proper divisors (50717039943186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30001102000110 is a wasteful number, since it uses less digits than its factorization.
30001102000110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22273719 (or 22273710 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 30001102000110 its reverse (1100020110003), we get a palindrome (31101122110113).
The spelling of 30001102000110 in words is "thirty trillion, one billion, one hundred two million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •