Base | Representation |
---|---|
bin | 1001011100011011010… |
… | …0100010011010001111 |
3 | 120111210102222002212112 |
4 | 2113012310202122033 |
5 | 10124241324414101 |
6 | 202311504454235 |
7 | 14502456402554 |
oct | 2270664423217 |
9 | 514712862775 |
10 | 162249451151 |
11 | 6289a6490a7 |
12 | 2754101a37b |
13 | 123b92c38c8 |
14 | 7bd2584a2b |
15 | 43491c66bb |
hex | 25c6d2268f |
162249451151 has 2 divisors, whose sum is σ = 162249451152. Its totient is φ = 162249451150.
The previous prime is 162249451141. The next prime is 162249451213. The reversal of 162249451151 is 151154942261.
162249451151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (151154942261) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-162249451151 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 162249451099 and 162249451108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (162249451141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 81124725575 + 81124725576.
It is an arithmetic number, because the mean of its divisors is an integer number (81124725576).
Almost surely, 2162249451151 is an apocalyptic number.
162249451151 is a deficient number, since it is larger than the sum of its proper divisors (1).
162249451151 is an equidigital number, since it uses as much as digits as its factorization.
162249451151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 86400, while the sum is 41.
The spelling of 162249451151 in words is "one hundred sixty-two billion, two hundred forty-nine million, four hundred fifty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •