Base | Representation |
---|---|
bin | 10000000001100101001… |
… | …111001010100100001110 |
3 | 10220021102020002022122110 |
4 | 100001211033022210032 |
5 | 121020234241231110 |
6 | 2201520002124450 |
7 | 142363004265543 |
oct | 20014517124416 |
9 | 3807366068573 |
10 | 1101210102030 |
11 | 395025437615 |
12 | 159509050726 |
13 | 7cac76c888c |
14 | 3b4280a6bca |
15 | 1d9a1d34a20 |
hex | 100653ca90e |
1101210102030 has 32 divisors (see below), whose sum is σ = 2714334092064. Its totient is φ = 285719377536.
The previous prime is 1101210102011. The next prime is 1101210102049. The reversal of 1101210102030 is 302010121011.
It is an interprime number because it is at equal distance from previous prime (1101210102011) and next prime (1101210102049).
It is a junction number, because it is equal to n+sod(n) for n = 1101210101997 and 1101210102015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 496039477 + ... + 496041696.
It is an arithmetic number, because the mean of its divisors is an integer number (84822940377).
Almost surely, 21101210102030 is an apocalyptic number.
1101210102030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1101210102030 is an abundant number, since it is smaller than the sum of its proper divisors (1613123990034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101210102030 is a wasteful number, since it uses less digits than its factorization.
1101210102030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 992081220.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1101210102030 its reverse (302010121011), we get a palindrome (1403220223041).
The spelling of 1101210102030 in words is "one trillion, one hundred one billion, two hundred ten million, one hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •