Base | Representation |
---|---|
bin | 10001110000010100010… |
… | …010100001001101010111 |
3 | 11022122022122022101212101 |
4 | 101300110102201031113 |
5 | 124442241421022444 |
6 | 2332302235302531 |
7 | 154102330216504 |
oct | 21602422411527 |
9 | 4278278271771 |
10 | 1220111110999 |
11 | 43049aa06490 |
12 | 1785708aaa47 |
13 | 8b095cc65a1 |
14 | 430a74944ab |
15 | 21b105a33d4 |
hex | 11c144a1357 |
1220111110999 has 32 divisors (see below), whose sum is σ = 1399126982400. Its totient is φ = 1053715703040.
The previous prime is 1220111110969. The next prime is 1220111111029. The reversal of 1220111110999 is 9990111110221.
It is an interprime number because it is at equal distance from previous prime (1220111110969) and next prime (1220111111029).
It is not a de Polignac number, because 1220111110999 - 29 = 1220111110487 is a prime.
It is a super-2 number, since 2×12201111109992 (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 (1220111110949) 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, 18326179 + ... + 18392635.
It is an arithmetic number, because the mean of its divisors is an integer number (43722718200).
Almost surely, 21220111110999 is an apocalyptic number.
1220111110999 is a deficient number, since it is larger than the sum of its proper divisors (179015871401).
1220111110999 is a wasteful number, since it uses less digits than its factorization.
1220111110999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67423.
The product of its (nonzero) digits is 2916, while the sum is 37.
The spelling of 1220111110999 in words is "one trillion, two hundred twenty billion, one hundred eleven million, one hundred ten thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •