Base | Representation |
---|---|
bin | 100100101110100… |
… | …1110111011001001 |
3 | 10011212222102002011 |
4 | 1021131032323021 |
5 | 10010443300243 |
6 | 322142335521 |
7 | 42353141062 |
oct | 11135167311 |
9 | 3155872064 |
10 | 1232400073 |
11 | 582726463 |
12 | 2a488a5a1 |
13 | 168429a18 |
14 | b9965569 |
15 | 732da89d |
hex | 4974eec9 |
1232400073 has 2 divisors, whose sum is σ = 1232400074. Its totient is φ = 1232400072.
The previous prime is 1232400041. The next prime is 1232400101. The reversal of 1232400073 is 3700042321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1088472064 + 143928009 = 32992^2 + 11997^2 .
It is an emirp because it is prime and its reverse (3700042321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1232400073 - 25 = 1232400041 is a prime.
It is not a weakly prime, because it can be changed into another prime (1232400473) 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, 616200036 + 616200037.
It is an arithmetic number, because the mean of its divisors is an integer number (616200037).
Almost surely, 21232400073 is an apocalyptic number.
It is an amenable number.
1232400073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1232400073 is an equidigital number, since it uses as much as digits as its factorization.
1232400073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 22.
The square root of 1232400073 is about 35105.5561556857. The cubic root of 1232400073 is about 1072.1377104707.
Adding to 1232400073 its reverse (3700042321), we get a palindrome (4932442394).
The spelling of 1232400073 in words is "one billion, two hundred thirty-two million, four hundred thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •