Base | Representation |
---|---|
bin | 1010000111010001001111… |
… | …0001101001011000100100 |
3 | 1110101001200001210112120111 |
4 | 2201310103301221120210 |
5 | 2424142231020023022 |
6 | 35352243005142404 |
7 | 2225252006250304 |
oct | 241642361513044 |
9 | 43331601715514 |
10 | 11120002111012 |
11 | 35a7a6a326073 |
12 | 12b716a25aa04 |
13 | 6287c4b9a232 |
14 | 2a62d4cab604 |
15 | 1443cb92a477 |
hex | a1d13c69624 |
11120002111012 has 48 divisors (see below), whose sum is σ = 21048803838720. Its totient is φ = 5120216658432.
The previous prime is 11120002110989. The next prime is 11120002111033. The reversal of 11120002111012 is 21011120002111.
It is a happy number.
It is a super-3 number, since 3×111200021110123 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 11120002110983 and 11120002111001.
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 in 15 ways as a sum of consecutive naturals, for example, 11384923 + ... + 12323005.
It is an arithmetic number, because the mean of its divisors is an integer number (438516746640).
Almost surely, 211120002111012 is an apocalyptic number.
It is an amenable number.
11120002111012 is a deficient number, since it is larger than the sum of its proper divisors (9928801727708).
11120002111012 is a wasteful number, since it uses less digits than its factorization.
11120002111012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 941860 (or 941858 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11120002111012 its reverse (21011120002111), we get a palindrome (32131122113123).
The spelling of 11120002111012 in words is "eleven trillion, one hundred twenty billion, two million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •