Base | Representation |
---|---|
bin | 10011010101000… |
… | …10100001100001 |
3 | 102022002220001021 |
4 | 21222202201201 |
5 | 313002141101 |
6 | 24031205441 |
7 | 4006136014 |
oct | 1152424141 |
9 | 368086037 |
10 | 162146401 |
11 | 83588a9a |
12 | 46376881 |
13 | 27792721 |
14 | 1776b37b |
15 | e37d5a1 |
hex | 9aa2861 |
162146401 has 4 divisors (see below), whose sum is σ = 162304704. Its totient is φ = 161988100.
The previous prime is 162146371. The next prime is 162146407. The reversal of 162146401 is 104641261.
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: 104641261 = 8803 ⋅11887.
It is a cyclic number.
It is not a de Polignac number, because 162146401 - 29 = 162145889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (162146407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 77605 + ... + 79666.
It is an arithmetic number, because the mean of its divisors is an integer number (40576176).
Almost surely, 2162146401 is an apocalyptic number.
It is an amenable number.
162146401 is a deficient number, since it is larger than the sum of its proper divisors (158303).
162146401 is a wasteful number, since it uses less digits than its factorization.
162146401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158302.
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 162146401 is about 12733.6719370337. The cubic root of 162146401 is about 545.3003433896.
Adding to 162146401 its reverse (104641261), we get a palindrome (266787662).
The spelling of 162146401 in words is "one hundred sixty-two million, one hundred forty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •