Base | Representation |
---|---|
bin | 1010001100101000101100… |
… | …1101001000111010111111 |
3 | 1110200212122111121200012002 |
4 | 2203022023031020322333 |
5 | 2432200041212314444 |
6 | 35502451424332515 |
7 | 2235024525351314 |
oct | 243121315107277 |
9 | 43625574550162 |
10 | 11212200119999 |
11 | 363308173690a |
12 | 1310bbb17413b |
13 | 6343c91a4838 |
14 | 2aa95da88d0b |
15 | 1469c5c2dd4e |
hex | a328b348ebf |
11212200119999 has 8 divisors (see below), whose sum is σ = 11248181616672. Its totient is φ = 11176219641600.
The previous prime is 11212200119987. The next prime is 11212200120007. The reversal of 11212200119999 is 99991100221211.
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 11212200119999 - 216 = 11212200054463 is a prime.
It is a super-4 number, since 4×112122001199994 (a number of 53 digits) contains 4444 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 (11212200119909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26205302 + ... + 26629724.
It is an arithmetic number, because the mean of its divisors is an integer number (1406022702084).
Almost surely, 211212200119999 is an apocalyptic number.
11212200119999 is a deficient number, since it is larger than the sum of its proper divisors (35981496673).
11212200119999 is an equidigital number, since it uses as much as digits as its factorization.
11212200119999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509137.
The product of its (nonzero) digits is 52488, while the sum is 47.
The spelling of 11212200119999 in words is "eleven trillion, two hundred twelve billion, two hundred million, one hundred nineteen thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •