Base | Representation |
---|---|
bin | 111101001000… |
… | …011101000101 |
3 | 1010011011201211 |
4 | 331020131011 |
5 | 13100303123 |
6 | 1331251421 |
7 | 253133215 |
oct | 75103505 |
9 | 33134654 |
10 | 16025413 |
11 | 9056148 |
12 | 5449b71 |
13 | 34212c1 |
14 | 21b2245 |
15 | 161840d |
hex | f48745 |
16025413 has 2 divisors, whose sum is σ = 16025414. Its totient is φ = 16025412.
The previous prime is 16025393. The next prime is 16025431. The reversal of 16025413 is 31452061.
16025413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (16025431) 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., 16016004 + 9409 = 4002^2 + 97^2 .
It is an emirp because it is prime and its reverse (31452061) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16025413 - 25 = 16025381 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16025453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8012706 + 8012707.
It is an arithmetic number, because the mean of its divisors is an integer number (8012707).
Almost surely, 216025413 is an apocalyptic number.
It is an amenable number.
16025413 is a deficient number, since it is larger than the sum of its proper divisors (1).
16025413 is an equidigital number, since it uses as much as digits as its factorization.
16025413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 16025413 is about 4003.1753646324. The cubic root of 16025413 is about 252.1175492992.
Adding to 16025413 its reverse (31452061), we get a palindrome (47477474).
The spelling of 16025413 in words is "sixteen million, twenty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •