Base | Representation |
---|---|
bin | 111101100001… |
… | …011111111101 |
3 | 1010100101110020 |
4 | 331201133331 |
5 | 13112043442 |
6 | 1333402353 |
7 | 254041254 |
oct | 75413775 |
9 | 33311406 |
10 | 16127997 |
11 | 9116226 |
12 | 54993b9 |
13 | 3458bc2 |
14 | 21db79b |
15 | 16389ec |
hex | f617fd |
16127997 has 4 divisors (see below), whose sum is σ = 21504000. Its totient is φ = 10751996.
The previous prime is 16127989. The next prime is 16127999. The reversal of 16127997 is 79972161.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 79972161 = 3 ⋅26657387.
It is a cyclic number.
It is not a de Polignac number, because 16127997 - 23 = 16127989 is a prime.
It is a super-2 number, since 2×161279972 = 520224574464018, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16127999) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2687997 + ... + 2688002.
It is an arithmetic number, because the mean of its divisors is an integer number (5376000).
Almost surely, 216127997 is an apocalyptic number.
It is an amenable number.
16127997 is a deficient number, since it is larger than the sum of its proper divisors (5376003).
16127997 is an equidigital number, since it uses as much as digits as its factorization.
16127997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5376002.
The product of its digits is 47628, while the sum is 42.
The square root of 16127997 is about 4015.9677538546. The cubic root of 16127997 is about 252.6543682407.
The spelling of 16127997 in words is "sixteen million, one hundred twenty-seven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •