Base | Representation |
---|---|
bin | 111001000000001010… |
… | …1111100101010011001 |
3 | 102200222010101020101201 |
4 | 1302000111330222121 |
5 | 4001200023241213 |
6 | 132122504514201 |
7 | 11562330364333 |
oct | 1620025745231 |
9 | 380863336351 |
10 | 122412321433 |
11 | 47a076229a6 |
12 | 1b88377b961 |
13 | b70abc83bc |
14 | 5cd3892453 |
15 | 32b6b626dd |
hex | 1c8057ca99 |
122412321433 has 2 divisors, whose sum is σ = 122412321434. Its totient is φ = 122412321432.
The previous prime is 122412321359. The next prime is 122412321491. The reversal of 122412321433 is 334123214221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119638508544 + 2773812889 = 345888^2 + 52667^2 .
It is a cyclic number.
It is not a de Polignac number, because 122412321433 - 225 = 122378767001 is a prime.
It is a super-2 number, since 2×1224123214332 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (122412321533) 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 as a sum of consecutive naturals, namely, 61206160716 + 61206160717.
It is an arithmetic number, because the mean of its divisors is an integer number (61206160717).
Almost surely, 2122412321433 is an apocalyptic number.
It is an amenable number.
122412321433 is a deficient number, since it is larger than the sum of its proper divisors (1).
122412321433 is an equidigital number, since it uses as much as digits as its factorization.
122412321433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6912, while the sum is 28.
Adding to 122412321433 its reverse (334123214221), we get a palindrome (456535535654).
The spelling of 122412321433 in words is "one hundred twenty-two billion, four hundred twelve million, three hundred twenty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •