Base | Representation |
---|---|
bin | 1010001100101000010101… |
… | …0011000100101000011111 |
3 | 1110200212101121010110120102 |
4 | 2203022011103010220133 |
5 | 2432144340324340444 |
6 | 35502433524211315 |
7 | 2235022213062566 |
oct | 243120523045037 |
9 | 43625347113512 |
10 | 11212101011999 |
11 | 36330307a4578 |
12 | 1310b91b39b3b |
13 | 6343b17b4054 |
14 | 2aa95084abdd |
15 | 1469bc1a384e |
hex | a32854c4a1f |
11212101011999 has 8 divisors (see below), whose sum is σ = 11965113819648. Its totient is φ = 10469474588160.
The previous prime is 11212101011957. The next prime is 11212101012023. The reversal of 11212101011999 is 99911010121211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11212101011999 - 240 = 10112589384223 is a prime.
It is a super-2 number, since 2×112121010119992 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11212101011099) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2596593722 + ... + 2596598039.
It is an arithmetic number, because the mean of its divisors is an integer number (1495639227456).
Almost surely, 211212101011999 is an apocalyptic number.
11212101011999 is a deficient number, since it is larger than the sum of its proper divisors (753012807649).
11212101011999 is a wasteful number, since it uses less digits than its factorization.
11212101011999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5193191905.
The product of its (nonzero) digits is 2916, while the sum is 38.
The spelling of 11212101011999 in words is "eleven trillion, two hundred twelve billion, one hundred one million, eleven thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •