Base | Representation |
---|---|
bin | 10011010001011… |
… | …00010111001011 |
3 | 102021012022010201 |
4 | 21220230113023 |
5 | 312341144121 |
6 | 24012553031 |
7 | 4002051661 |
oct | 1150542713 |
9 | 367168121 |
10 | 161662411 |
11 | 832883a9 |
12 | 46182777 |
13 | 27653341 |
14 | 17682c31 |
15 | e2d4e91 |
hex | 9a2c5cb |
161662411 has 2 divisors, whose sum is σ = 161662412. Its totient is φ = 161662410.
The previous prime is 161662409. The next prime is 161662441. The reversal of 161662411 is 114266161.
161662411 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 (114266161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 161662411 - 21 = 161662409 is a prime.
It is a super-2 number, since 2×1616624112 = 52269470260665842, which contains 22 as substring.
Together with 161662409, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 161662411.
It is not a weakly prime, because it can be changed into another prime (161662441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80831205 + 80831206.
It is an arithmetic number, because the mean of its divisors is an integer number (80831206).
Almost surely, 2161662411 is an apocalyptic number.
161662411 is a deficient number, since it is larger than the sum of its proper divisors (1).
161662411 is an equidigital number, since it uses as much as digits as its factorization.
161662411 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1728, while the sum is 28.
The square root of 161662411 is about 12714.6533967702. The cubic root of 161662411 is about 544.7572478928.
The spelling of 161662411 in words is "one hundred sixty-one million, six hundred sixty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •