Base | Representation |
---|---|
bin | 1001011001100111010… |
… | …1111000010001110111 |
3 | 120102211212000021201112 |
4 | 2112121311320101313 |
5 | 10121220134000101 |
6 | 202104550345235 |
7 | 14444664250526 |
oct | 2263165702167 |
9 | 512755007645 |
10 | 161494828151 |
11 | 62542690728 |
12 | 2737035b21b |
13 | 122c8b6ab17 |
14 | 7b6026c4bd |
15 | 4302d146bb |
hex | 2599d78477 |
161494828151 has 2 divisors, whose sum is σ = 161494828152. Its totient is φ = 161494828150.
The previous prime is 161494828129. The next prime is 161494828153. The reversal of 161494828151 is 151828494161.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 161494828151 - 226 = 161427719287 is a prime.
It is a Sophie Germain prime.
Together with 161494828153, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 161494828151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (161494828153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80747414075 + 80747414076.
It is an arithmetic number, because the mean of its divisors is an integer number (80747414076).
Almost surely, 2161494828151 is an apocalyptic number.
161494828151 is a deficient number, since it is larger than the sum of its proper divisors (1).
161494828151 is an equidigital number, since it uses as much as digits as its factorization.
161494828151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 552960, while the sum is 50.
The spelling of 161494828151 in words is "one hundred sixty-one billion, four hundred ninety-four million, eight hundred twenty-eight thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •