Base | Representation |
---|---|
bin | 1001011011100100101… |
… | …0000100100101101111 |
3 | 120111012110121201012022 |
4 | 2112321022010211233 |
5 | 10123304133341101 |
6 | 202233035300355 |
7 | 14464004051204 |
oct | 2267112044557 |
9 | 514173551168 |
10 | 162020215151 |
11 | 62792207763 |
12 | 274982aa6bb |
13 | 123809712c2 |
14 | 7badd51cab |
15 | 4333ee4a1b |
hex | 25b928496f |
162020215151 has 2 divisors, whose sum is σ = 162020215152. Its totient is φ = 162020215150.
The previous prime is 162020215139. The next prime is 162020215157. The reversal of 162020215151 is 151512020261.
162020215151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 162020215151 - 222 = 162016020847 is a prime.
It is a super-3 number, since 3×1620202151513 (a number of 35 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 162020215151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (162020215157) 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, 81010107575 + 81010107576.
It is an arithmetic number, because the mean of its divisors is an integer number (81010107576).
Almost surely, 2162020215151 is an apocalyptic number.
162020215151 is a deficient number, since it is larger than the sum of its proper divisors (1).
162020215151 is an equidigital number, since it uses as much as digits as its factorization.
162020215151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 26.
The spelling of 162020215151 in words is "one hundred sixty-two billion, twenty million, two hundred fifteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •