Base | Representation |
---|---|
bin | 111110101010… |
… | …010111000001 |
3 | 1010220112211102 |
4 | 332222113001 |
5 | 13201121213 |
6 | 1344024145 |
7 | 256423322 |
oct | 76522701 |
9 | 33815742 |
10 | 16426433 |
11 | 92aa471 |
12 | 5602055 |
13 | 35319aa |
14 | 2278449 |
15 | 1697158 |
hex | faa5c1 |
16426433 has 2 divisors, whose sum is σ = 16426434. Its totient is φ = 16426432.
The previous prime is 16426427. The next prime is 16426477. The reversal of 16426433 is 33462461.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13300609 + 3125824 = 3647^2 + 1768^2 .
It is a cyclic number.
It is not a de Polignac number, because 16426433 - 212 = 16422337 is a prime.
It is a super-2 number, since 2×164264332 = 539655402206978, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 16426396 and 16426405.
It is not a weakly prime, because it can be changed into another prime (16426493) 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, 8213216 + 8213217.
It is an arithmetic number, because the mean of its divisors is an integer number (8213217).
Almost surely, 216426433 is an apocalyptic number.
It is an amenable number.
16426433 is a deficient number, since it is larger than the sum of its proper divisors (1).
16426433 is an equidigital number, since it uses as much as digits as its factorization.
16426433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10368, while the sum is 29.
The square root of 16426433 is about 4052.9536143410. The cubic root of 16426433 is about 254.2032442327.
Adding to 16426433 its reverse (33462461), we get a palindrome (49888894).
The spelling of 16426433 in words is "sixteen million, four hundred twenty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •