Base | Representation |
---|---|
bin | 10000000000101110111… |
… | …111011100011001101000 |
3 | 10220012001210120220121102 |
4 | 100000232333130121220 |
5 | 121011403300323422 |
6 | 2201245411500532 |
7 | 142331313531341 |
oct | 20005677343150 |
9 | 3805053526542 |
10 | 1100300011112 |
11 | 3946a8742865 |
12 | 1592b42b7748 |
13 | 7c9b0cab143 |
14 | 3b37d2810c8 |
15 | 1d94beb3192 |
hex | 1002efdc668 |
1100300011112 has 8 divisors (see below), whose sum is σ = 2063062520850. Its totient is φ = 550150005552.
The previous prime is 1100300011067. The next prime is 1100300011159. The reversal of 1100300011112 is 2111100030011.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 927996982276 + 172303028836 = 963326^2 + 415094^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×11003000111122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1100300011093 and 1100300011102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68768750687 + ... + 68768750702.
Almost surely, 21100300011112 is an apocalyptic number.
It is an amenable number.
1100300011112 is a deficient number, since it is larger than the sum of its proper divisors (962762509738).
1100300011112 is a wasteful number, since it uses less digits than its factorization.
1100300011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137537501395 (or 137537501391 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 1100300011112 its reverse (2111100030011), we get a palindrome (3211400041123).
The spelling of 1100300011112 in words is "one trillion, one hundred billion, three hundred million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •