Base | Representation |
---|---|
bin | 110101101101100101010100… |
… | …0000011000111100010100101 |
3 | 2021221211112012020120010001111 |
4 | 1223123022220003013202211 |
5 | 443411222044320243242 |
6 | 4352500042241025021 |
7 | 201341644004620666 |
oct | 15333125003074245 |
9 | 2257745166503044 |
10 | 472457811884197 |
11 | 1275a326194a197 |
12 | 44ba55a5325171 |
13 | 17381771454049 |
14 | 8495119b4d36d |
15 | 3994aa2acc817 |
hex | 1adb2a80c78a5 |
472457811884197 has 2 divisors, whose sum is σ = 472457811884198. Its totient is φ = 472457811884196.
The previous prime is 472457811884173. The next prime is 472457811884203. The reversal of 472457811884197 is 791488118754274.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 245818215745281 + 226639596138916 = 15678591^2 + 15054554^2 .
It is a cyclic number.
It is not a de Polignac number, because 472457811884197 - 211 = 472457811882149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (472457811884137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 236228905942098 + 236228905942099.
It is an arithmetic number, because the mean of its divisors is an integer number (236228905942099).
Almost surely, 2472457811884197 is an apocalyptic number.
It is an amenable number.
472457811884197 is a deficient number, since it is larger than the sum of its proper divisors (1).
472457811884197 is an equidigital number, since it uses as much as digits as its factorization.
472457811884197 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1011548160, while the sum is 76.
The spelling of 472457811884197 in words is "four hundred seventy-two trillion, four hundred fifty-seven billion, eight hundred eleven million, eight hundred eighty-four thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •