Base | Representation |
---|---|
bin | 11100001100001… |
… | …011010000111001 |
3 | 1012221221112210121 |
4 | 130030023100321 |
5 | 1432034011123 |
6 | 114533013241 |
7 | 14502020245 |
oct | 3414132071 |
9 | 1187845717 |
10 | 472953913 |
11 | 222a74303 |
12 | 112484221 |
13 | 76ca57b3 |
14 | 46b55425 |
15 | 2b7c475d |
hex | 1c30b439 |
472953913 has 2 divisors, whose sum is σ = 472953914. Its totient is φ = 472953912.
The previous prime is 472953907. The next prime is 472953931. The reversal of 472953913 is 319359274.
Together with next prime (472953931) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 472932009 + 21904 = 21747^2 + 148^2 .
It is a cyclic number.
It is not a de Polignac number, because 472953913 - 221 = 470856761 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 472953913.
It is not a weakly prime, because it can be changed into another prime (472953973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 236476956 + 236476957.
It is an arithmetic number, because the mean of its divisors is an integer number (236476957).
Almost surely, 2472953913 is an apocalyptic number.
It is an amenable number.
472953913 is a deficient number, since it is larger than the sum of its proper divisors (1).
472953913 is an equidigital number, since it uses as much as digits as its factorization.
472953913 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 204120, while the sum is 43.
The square root of 472953913 is about 21747.5036038622. The cubic root of 472953913 is about 779.1234471545.
The spelling of 472953913 in words is "four hundred seventy-two million, nine hundred fifty-three thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •