Base | Representation |
---|---|
bin | 111110011101… |
… | …001000000101 |
3 | 1010210210110212 |
4 | 332131020011 |
5 | 13142402404 |
6 | 1342525205 |
7 | 256106306 |
oct | 76351005 |
9 | 33723425 |
10 | 16372229 |
11 | 9272775 |
12 | 5596805 |
13 | 3513113 |
14 | 22627ad |
15 | 168606e |
hex | f9d205 |
16372229 has 2 divisors, whose sum is σ = 16372230. Its totient is φ = 16372228.
The previous prime is 16372219. The next prime is 16372261. The reversal of 16372229 is 92227361.
It is a happy number.
16372229 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (16372261) can be obtained adding 16372229 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16120225 + 252004 = 4015^2 + 502^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16372229 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 16372195 and 16372204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16372219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8186114 + 8186115.
It is an arithmetic number, because the mean of its divisors is an integer number (8186115).
Almost surely, 216372229 is an apocalyptic number.
It is an amenable number.
16372229 is a deficient number, since it is larger than the sum of its proper divisors (1).
16372229 is an equidigital number, since it uses as much as digits as its factorization.
16372229 is an evil number, because the sum of its binary digits is even.
The product of its digits is 9072, while the sum is 32.
The square root of 16372229 is about 4046.2611136702. The cubic root of 16372229 is about 253.9233292057.
The spelling of 16372229 in words is "sixteen million, three hundred seventy-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •