Base | Representation |
---|---|
bin | 10000010011011000011… |
… | …101010001000001001001 |
3 | 10222002202020110112211121 |
4 | 100103120131101001021 |
5 | 121323410200004442 |
6 | 2214400322555241 |
7 | 143640435531613 |
oct | 20233035210111 |
9 | 3862666415747 |
10 | 1120323047497 |
11 | 3a2143176415 |
12 | 161161b08b21 |
13 | 81852390274 |
14 | 3c31c641db3 |
15 | 1e21ec7e967 |
hex | 104d8751049 |
1120323047497 has 2 divisors, whose sum is σ = 1120323047498. Its totient is φ = 1120323047496.
The previous prime is 1120323047479. The next prime is 1120323047507. The reversal of 1120323047497 is 7947403230211.
It is a happy number.
Together with previous prime (1120323047479) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 813705027136 + 306618020361 = 902056^2 + 553731^2 .
It is an emirp because it is prime and its reverse (7947403230211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1120323047497 - 223 = 1120314658889 is a prime.
It is not a weakly prime, because it can be changed into another prime (1120323047407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560161523748 + 560161523749.
It is an arithmetic number, because the mean of its divisors is an integer number (560161523749).
Almost surely, 21120323047497 is an apocalyptic number.
It is an amenable number.
1120323047497 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120323047497 is an equidigital number, since it uses as much as digits as its factorization.
1120323047497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 254016, while the sum is 43.
The spelling of 1120323047497 in words is "one trillion, one hundred twenty billion, three hundred twenty-three million, forty-seven thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •