Base | Representation |
---|---|
bin | 11001000000101110100000… |
… | …100111110100011111000100 |
3 | 112102111000001221112220101011 |
4 | 121000232200213310133010 |
5 | 103404224224131223022 |
6 | 1025541450404012004 |
7 | 32112213600251665 |
oct | 3100564047643704 |
9 | 472430057486334 |
10 | 110001102211012 |
11 | 32060229525691 |
12 | 10406b4a691004 |
13 | 494c0a074761c |
14 | 1d2412049736c |
15 | cab5ab383977 |
hex | 640ba09f47c4 |
110001102211012 has 24 divisors (see below), whose sum is σ = 203831429991840. Its totient is φ = 51763736760960.
The previous prime is 110001102210959. The next prime is 110001102211043. The reversal of 110001102211012 is 210112201100011.
It is a happy number.
It is a super-2 number, since 2×1100011022110122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110001102210983 and 110001102211001.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20861914 + ... + 25597297.
It is an arithmetic number, because the mean of its divisors is an integer number (8492976249660).
Almost surely, 2110001102211012 is an apocalyptic number.
It is an amenable number.
110001102211012 is a deficient number, since it is larger than the sum of its proper divisors (93830327780828).
110001102211012 is a wasteful number, since it uses less digits than its factorization.
110001102211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46494051 (or 46494049 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110001102211012 its reverse (210112201100011), we get a palindrome (320113303311023).
The spelling of 110001102211012 in words is "one hundred ten trillion, one billion, one hundred two million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •