Base | Representation |
---|---|
bin | 1011000000010100011011… |
… | …0101001001110111101011 |
3 | 1120211202111112222121020112 |
4 | 2300011012311021313223 |
5 | 3041222011432241021 |
6 | 41422414144444535 |
7 | 2356130015201204 |
oct | 260050665116753 |
9 | 46752445877215 |
10 | 12100111212011 |
11 | 39456a036a159 |
12 | 14350ba91974b |
13 | 69a06026a244 |
14 | 2db91170c5ab |
15 | 15eb41cc6d5b |
hex | b0146d49deb |
12100111212011 has 16 divisors (see below), whose sum is σ = 12278882012160. Its totient is φ = 11922006021120.
The previous prime is 12100111211989. The next prime is 12100111212053. The reversal of 12100111212011 is 11021211100121.
12100111212011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12100111212011 - 222 = 12100107017707 is a prime.
It is a super-2 number, since 2×121001112120112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12100111512011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 74883896 + ... + 75045306.
It is an arithmetic number, because the mean of its divisors is an integer number (767430125760).
Almost surely, 212100111212011 is an apocalyptic number.
12100111212011 is a deficient number, since it is larger than the sum of its proper divisors (178770800149).
12100111212011 is a wasteful number, since it uses less digits than its factorization.
12100111212011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163466.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 12100111212011 its reverse (11021211100121), we get a palindrome (23121322312132).
The spelling of 12100111212011 in words is "twelve trillion, one hundred billion, one hundred eleven million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •