Base | Representation |
---|---|
bin | 110101101101100101010100… |
… | …0000011000111100010001011 |
3 | 2021221211112012020120010000112 |
4 | 1223123022220003013202023 |
5 | 443411222044320243141 |
6 | 4352500042241024535 |
7 | 201341644004620631 |
oct | 15333125003074213 |
9 | 2257745166503015 |
10 | 472457811884171 |
11 | 1275a326194a173 |
12 | 44ba55a532514b |
13 | 17381771454029 |
14 | 8495119b4d351 |
15 | 3994aa2acc7eb |
hex | 1adb2a80c788b |
472457811884171 has 2 divisors, whose sum is σ = 472457811884172. Its totient is φ = 472457811884170.
The previous prime is 472457811884137. The next prime is 472457811884173. The reversal of 472457811884171 is 171488118754274.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 472457811884171 - 214 = 472457811867787 is a prime.
It is a super-2 number, since 2×4724578118841712 (a number of 30 digits) contains 22 as substring.
Together with 472457811884173, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (472457811884173) 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, 236228905942085 + 236228905942086.
It is an arithmetic number, because the mean of its divisors is an integer number (236228905942086).
Almost surely, 2472457811884171 is an apocalyptic number.
472457811884171 is a deficient number, since it is larger than the sum of its proper divisors (1).
472457811884171 is an equidigital number, since it uses as much as digits as its factorization.
472457811884171 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 112394240, while the sum is 68.
The spelling of 472457811884171 in words is "four hundred seventy-two trillion, four hundred fifty-seven billion, eight hundred eleven million, eight hundred eighty-four thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •