Base | Representation |
---|---|
bin | 111110011011… |
… | …000110001001 |
3 | 1010210101001212 |
4 | 332123012021 |
5 | 13142121123 |
6 | 1342422505 |
7 | 256043126 |
oct | 76330611 |
9 | 33711055 |
10 | 16363913 |
11 | 92674a5 |
12 | 5591a35 |
13 | 350c3b7 |
14 | 225d74d |
15 | 1683878 |
hex | f9b189 |
16363913 has 2 divisors, whose sum is σ = 16363914. Its totient is φ = 16363912.
The previous prime is 16363903. The next prime is 16363927. The reversal of 16363913 is 31936361.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16224784 + 139129 = 4028^2 + 373^2 .
It is an emirp because it is prime and its reverse (31936361) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16363913 - 222 = 12169609 is a prime.
It is a Chen prime.
It is equal to p1052969 and since 16363913 and 1052969 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16363913.
It is not a weakly prime, because it can be changed into another prime (16363903) 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, 8181956 + 8181957.
It is an arithmetic number, because the mean of its divisors is an integer number (8181957).
Almost surely, 216363913 is an apocalyptic number.
It is an amenable number.
16363913 is a deficient number, since it is larger than the sum of its proper divisors (1).
16363913 is an equidigital number, since it uses as much as digits as its factorization.
16363913 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8748, while the sum is 32.
The square root of 16363913 is about 4045.2333678046. The cubic root of 16363913 is about 253.8803298880.
The spelling of 16363913 in words is "sixteen million, three hundred sixty-three thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •