Base | Representation |
---|---|
bin | 11100010000101… |
… | …101000010001101 |
3 | 1020001011211220212 |
4 | 130100231002031 |
5 | 1432340001223 |
6 | 115014252205 |
7 | 14515062506 |
oct | 3420550215 |
9 | 1201154825 |
10 | 474140813 |
11 | 223705013 |
12 | 112957065 |
13 | 772ccac3 |
14 | 46d83bad |
15 | 2b95b278 |
hex | 1c42d08d |
474140813 has 2 divisors, whose sum is σ = 474140814. Its totient is φ = 474140812.
The previous prime is 474140789. The next prime is 474140831. The reversal of 474140813 is 318041474.
Together with next prime (474140831) 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., 474063529 + 77284 = 21773^2 + 278^2 .
It is a cyclic number.
It is not a de Polignac number, because 474140813 - 210 = 474139789 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 474140813.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (474140873) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 237070406 + 237070407.
It is an arithmetic number, because the mean of its divisors is an integer number (237070407).
Almost surely, 2474140813 is an apocalyptic number.
It is an amenable number.
474140813 is a deficient number, since it is larger than the sum of its proper divisors (1).
474140813 is an equidigital number, since it uses as much as digits as its factorization.
474140813 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10752, while the sum is 32.
The square root of 474140813 is about 21774.7746945864. The cubic root of 474140813 is about 779.7746516447.
It can be divided in two parts, 4741 and 40813, that added together give a palindrome (45554).
The spelling of 474140813 in words is "four hundred seventy-four million, one hundred forty thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •