Base | Representation |
---|---|
bin | 1001011011110011111… |
… | …0001000110001001001 |
3 | 120111100221000020121012 |
4 | 2112330332020301021 |
5 | 10123422023223101 |
6 | 202243242453305 |
7 | 14465411633432 |
oct | 2267476106111 |
9 | 514327006535 |
10 | 162084195401 |
11 | 62815336aa7 |
12 | 274b5804235 |
13 | 12390cb2b3b |
14 | 7bb8648489 |
15 | 4339931bbb |
hex | 25bcf88c49 |
162084195401 has 2 divisors, whose sum is σ = 162084195402. Its totient is φ = 162084195400.
The previous prime is 162084195397. The next prime is 162084195437. The reversal of 162084195401 is 104591480261.
162084195401 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 can be written as a sum of positive squares in only one way, i.e., 105056367376 + 57027828025 = 324124^2 + 238805^2 .
It is an emirp because it is prime and its reverse (104591480261) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 162084195401 - 22 = 162084195397 is a prime.
It is not a weakly prime, because it can be changed into another prime (162084195491) 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, 81042097700 + 81042097701.
It is an arithmetic number, because the mean of its divisors is an integer number (81042097701).
Almost surely, 2162084195401 is an apocalyptic number.
It is an amenable number.
162084195401 is a deficient number, since it is larger than the sum of its proper divisors (1).
162084195401 is an equidigital number, since it uses as much as digits as its factorization.
162084195401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 41.
The spelling of 162084195401 in words is "one hundred sixty-two billion, eighty-four million, one hundred ninety-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •