Base | Representation |
---|---|
bin | 101010010111001… |
… | …1010011110110001 |
3 | 10200001201022021001 |
4 | 1110232122132301 |
5 | 10402343000413 |
6 | 353014402001 |
7 | 50140103344 |
oct | 12456323661 |
9 | 3601638231 |
10 | 1421453233 |
11 | 66a411942 |
12 | 338060301 |
13 | 1986504b5 |
14 | d6ad845b |
15 | 84bd14dd |
hex | 54b9a7b1 |
1421453233 has 2 divisors, whose sum is σ = 1421453234. Its totient is φ = 1421453232.
The previous prime is 1421453207. The next prime is 1421453237. The reversal of 1421453233 is 3323541241.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1414361664 + 7091569 = 37608^2 + 2663^2 .
It is an emirp because it is prime and its reverse (3323541241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1421453233 - 213 = 1421445041 is a prime.
It is not a weakly prime, because it can be changed into another prime (1421453237) 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, 710726616 + 710726617.
It is an arithmetic number, because the mean of its divisors is an integer number (710726617).
Almost surely, 21421453233 is an apocalyptic number.
It is an amenable number.
1421453233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1421453233 is an equidigital number, since it uses as much as digits as its factorization.
1421453233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8640, while the sum is 28.
The square root of 1421453233 is about 37702.1648317441. The cubic root of 1421453233 is about 1124.3741659562.
Adding to 1421453233 its reverse (3323541241), we get a palindrome (4744994474).
The spelling of 1421453233 in words is "one billion, four hundred twenty-one million, four hundred fifty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •