Base | Representation |
---|---|
bin | 10000010100111100100… |
… | …110100110000001100001 |
3 | 10222021002022222212120122 |
4 | 100110330212212001201 |
5 | 121340330310330213 |
6 | 2215235142450025 |
7 | 144030166651523 |
oct | 20247446460141 |
9 | 3867068885518 |
10 | 1122003214433 |
11 | 3a2925622732 |
12 | 161550733915 |
13 | 81a5c4b439a |
14 | 3c43b843a13 |
15 | 1e2bc516d08 |
hex | 1053c9a6061 |
1122003214433 has 16 divisors (see below), whose sum is σ = 1131861036240. Its totient is φ = 1112192987136.
The previous prime is 1122003214403. The next prime is 1122003214439. The reversal of 1122003214433 is 3344123002211.
It can be written as a sum of positive squares in 8 ways, for example, as 476138640784 + 645864573649 = 690028^2 + 803657^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122003214433 - 212 = 1122003210337 is a prime.
It is a super-2 number, since 2×11220032144332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1122003214439) 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, 89632091 + ... + 89644607.
It is an arithmetic number, because the mean of its divisors is an integer number (70741314765).
Almost surely, 21122003214433 is an apocalyptic number.
It is an amenable number.
1122003214433 is a deficient number, since it is larger than the sum of its proper divisors (9857821807).
1122003214433 is a wasteful number, since it uses less digits than its factorization.
1122003214433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14356.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 1122003214433 its reverse (3344123002211), we get a palindrome (4466126216644).
The spelling of 1122003214433 in words is "one trillion, one hundred twenty-two billion, three million, two hundred fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •