Base | Representation |
---|---|
bin | 10001101000000010100… |
… | …001011100101100100111 |
3 | 11021210101012221200011012 |
4 | 101220002201130230213 |
5 | 124321041103201244 |
6 | 2324232254332435 |
7 | 153336144323540 |
oct | 21500241345447 |
9 | 4253335850135 |
10 | 1211223100199 |
11 | 427749955412 |
12 | 1768b01ba11b |
13 | 8a2aa7c6bb8 |
14 | 428a2cb14c7 |
15 | 2179014889e |
hex | 11a0285cb27 |
1211223100199 has 32 divisors (see below), whose sum is σ = 1487854087680. Its totient is φ = 962994396672.
The previous prime is 1211223100193. The next prime is 1211223100201. The reversal of 1211223100199 is 9910013221121.
It is a happy number.
It is not a de Polignac number, because 1211223100199 - 28 = 1211223099943 is a prime.
It is a super-2 number, since 2×12112231001992 (a number of 25 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 (1211223100193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 874832 + ... + 1785434.
It is an arithmetic number, because the mean of its divisors is an integer number (46495440240).
Almost surely, 21211223100199 is an apocalyptic number.
1211223100199 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
1211223100199 is a deficient number, since it is larger than the sum of its proper divisors (276630987481).
1211223100199 is a wasteful number, since it uses less digits than its factorization.
1211223100199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 910839.
The product of its (nonzero) digits is 1944, while the sum is 32.
The spelling of 1211223100199 in words is "one trillion, two hundred eleven billion, two hundred twenty-three million, one hundred thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •