Base | Representation |
---|---|
bin | 10000010101010100100… |
… | …000110100101111010111 |
3 | 10222022010021210221000211 |
4 | 100111110200310233113 |
5 | 121342141003330111 |
6 | 2215343032350251 |
7 | 144043140413611 |
oct | 20252440645727 |
9 | 3868107727024 |
10 | 1122404355031 |
11 | 3a3010aa7593 |
12 | 161642b45387 |
13 | 81ac4634b9b |
14 | 3c478c23db1 |
15 | 1e2e2853521 |
hex | 10554834bd7 |
1122404355031 has 2 divisors, whose sum is σ = 1122404355032. Its totient is φ = 1122404355030.
The previous prime is 1122404354987. The next prime is 1122404355077. The reversal of 1122404355031 is 1305534042211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1122404355031 - 225 = 1122370800599 is a prime.
It is a super-2 number, since 2×11224043550312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1122404354984 and 1122404355002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1122404350031) 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, 561202177515 + 561202177516.
It is an arithmetic number, because the mean of its divisors is an integer number (561202177516).
Almost surely, 21122404355031 is an apocalyptic number.
1122404355031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122404355031 is an equidigital number, since it uses as much as digits as its factorization.
1122404355031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 1122404355031 its reverse (1305534042211), we get a palindrome (2427938397242).
The spelling of 1122404355031 in words is "one trillion, one hundred twenty-two billion, four hundred four million, three hundred fifty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •