Base | Representation |
---|---|
bin | 10000000000101001101… |
… | …000110110000111000111 |
3 | 10220011211112121002100010 |
4 | 100000221220312013013 |
5 | 121011212302413111 |
6 | 2201232442521303 |
7 | 142326143256354 |
oct | 20005150660707 |
9 | 3804745532303 |
10 | 1100210201031 |
11 | 394661a81157 |
12 | 15928a206233 |
13 | 7c9984c4796 |
14 | 3b37138362b |
15 | 1d944172aa6 |
hex | 10029a361c7 |
1100210201031 has 8 divisors (see below), whose sum is σ = 1466952492544. Its totient is φ = 733470688440.
The previous prime is 1100210201017. The next prime is 1100210201081. The reversal of 1100210201031 is 1301020120011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1100210201031 - 230 = 1099136459207 is a prime.
It is a super-2 number, since 2×11002102010312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100210200998 and 1100210201016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100210201081) 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, 545220 + ... + 1580406.
It is an arithmetic number, because the mean of its divisors is an integer number (183369061568).
Almost surely, 21100210201031 is an apocalyptic number.
1100210201031 is a deficient number, since it is larger than the sum of its proper divisors (366742291513).
1100210201031 is a wasteful number, since it uses less digits than its factorization.
1100210201031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1389461.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1100210201031 its reverse (1301020120011), we get a palindrome (2401230321042).
The spelling of 1100210201031 in words is "one trillion, one hundred billion, two hundred ten million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •