Base | Representation |
---|---|
bin | 10000010101110001101… |
… | …110011001001000011101 |
3 | 10222100101110000101121212 |
4 | 100111301232121020131 |
5 | 121344141434414404 |
6 | 2215503421034205 |
7 | 144061241231525 |
oct | 20256156311035 |
9 | 3870343011555 |
10 | 1122894451229 |
11 | 3a324270a071 |
12 | 16175b0b5965 |
13 | 81b72030135 |
14 | 3c4c3d5c685 |
15 | 1e3208b206e |
hex | 10571b9921d |
1122894451229 has 2 divisors, whose sum is σ = 1122894451230. Its totient is φ = 1122894451228.
The previous prime is 1122894451219. The next prime is 1122894451267. The reversal of 1122894451229 is 9221544982211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 658738387129 + 464156064100 = 811627^2 + 681290^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122894451229 - 224 = 1122877674013 is a prime.
It is a super-2 number, since 2×11228944512292 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1122894451219) 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 as a sum of consecutive naturals, namely, 561447225614 + 561447225615.
It is an arithmetic number, because the mean of its divisors is an integer number (561447225615).
Almost surely, 21122894451229 is an apocalyptic number.
It is an amenable number.
1122894451229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122894451229 is an equidigital number, since it uses as much as digits as its factorization.
1122894451229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 829440, while the sum is 50.
The spelling of 1122894451229 in words is "one trillion, one hundred twenty-two billion, eight hundred ninety-four million, four hundred fifty-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •