Base | Representation |
---|---|
bin | 11100100011100… |
… | …000011110110011 |
3 | 1020101110021200012 |
4 | 130203200132303 |
5 | 1440120221011 |
6 | 115312045135 |
7 | 14605012631 |
oct | 3443403663 |
9 | 1211407605 |
10 | 479070131 |
11 | 226471531 |
12 | 1145337ab |
13 | 78337667 |
14 | 478a8351 |
15 | 2c0d1a8b |
hex | 1c8e07b3 |
479070131 has 2 divisors, whose sum is σ = 479070132. Its totient is φ = 479070130.
The previous prime is 479070103. The next prime is 479070133. The reversal of 479070131 is 131070974.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 479070131 - 214 = 479053747 is a prime.
It is a super-2 number, since 2×4790701312 = 459016380832714322, which contains 22 as substring.
Together with 479070133, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p25309670 and since 479070131 and 25309670 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (479070133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 239535065 + 239535066.
It is an arithmetic number, because the mean of its divisors is an integer number (239535066).
Almost surely, 2479070131 is an apocalyptic number.
479070131 is a deficient number, since it is larger than the sum of its proper divisors (1).
479070131 is an equidigital number, since it uses as much as digits as its factorization.
479070131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5292, while the sum is 32.
The square root of 479070131 is about 21887.6707531889. The cubic root of 479070131 is about 782.4676022203.
The spelling of 479070131 in words is "four hundred seventy-nine million, seventy thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •