Base | Representation |
---|---|
bin | 11011111111110… |
… | …010000011010001 |
3 | 1012201211111000021 |
4 | 123333302003101 |
5 | 1430221024123 |
6 | 114335223441 |
7 | 14432266036 |
oct | 3377620321 |
9 | 1181744007 |
10 | 469704913 |
11 | 221155287 |
12 | 111377b81 |
13 | 76408a02 |
14 | 4654b38d |
15 | 2b381c5d |
hex | 1bff20d1 |
469704913 has 2 divisors, whose sum is σ = 469704914. Its totient is φ = 469704912.
The previous prime is 469704889. The next prime is 469704931. The reversal of 469704913 is 319407964.
Together with next prime (469704931) 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., 382319809 + 87385104 = 19553^2 + 9348^2 .
It is a cyclic number.
It is not a de Polignac number, because 469704913 - 25 = 469704881 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 469704913.
It is not a weakly prime, because it can be changed into another prime (469704013) 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, 234852456 + 234852457.
It is an arithmetic number, because the mean of its divisors is an integer number (234852457).
Almost surely, 2469704913 is an apocalyptic number.
It is an amenable number.
469704913 is a deficient number, since it is larger than the sum of its proper divisors (1).
469704913 is an equidigital number, since it uses as much as digits as its factorization.
469704913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 163296, while the sum is 43.
The square root of 469704913 is about 21672.6766459522. The cubic root of 469704913 is about 777.3352596723.
The spelling of 469704913 in words is "four hundred sixty-nine million, seven hundred four thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •