Base | Representation |
---|---|
bin | 10000000000101001101… |
… | …011111011100111101111 |
3 | 10220011211121010012002002 |
4 | 100000221223323213233 |
5 | 121011213004310111 |
6 | 2201232512122515 |
7 | 142326153166100 |
oct | 20005153734757 |
9 | 3804747105062 |
10 | 1100211010031 |
11 | 394662483a51 |
12 | 15928a53643b |
13 | 7c998718a93 |
14 | 3b3715143a7 |
15 | 1d94428263b |
hex | 10029afb9ef |
1100211010031 has 12 divisors (see below), whose sum is σ = 1281139324272. Its totient is φ = 942078620448.
The previous prime is 1100211009959. The next prime is 1100211010081. The reversal of 1100211010031 is 1300101120011.
It is a happy number.
It is not a de Polignac number, because 1100211010031 - 214 = 1100210993647 is a prime.
It is a super-2 number, since 2×11002110100312 (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 = 1100211009994 and 1100211010021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100211010081) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11372630 + ... + 11468963.
It is an arithmetic number, because the mean of its divisors is an integer number (106761610356).
Almost surely, 21100211010031 is an apocalyptic number.
1100211010031 is a deficient number, since it is larger than the sum of its proper divisors (180928314241).
1100211010031 is an equidigital number, since it uses as much as digits as its factorization.
1100211010031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22842590 (or 22842583 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 1100211010031 its reverse (1300101120011), we get a palindrome (2400312130042).
The spelling of 1100211010031 in words is "one trillion, one hundred billion, two hundred eleven million, ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •