Base | Representation |
---|---|
bin | 1001011001010100011… |
… | …1000100110110011011 |
3 | 120102122022122110101102 |
4 | 2112111013010312123 |
5 | 10121034323400021 |
6 | 202053033142015 |
7 | 14443011454424 |
oct | 2262507046633 |
9 | 512568573342 |
10 | 161415450011 |
11 | 625018a4762 |
12 | 2734985a90b |
13 | 122b55977ca |
14 | 7b538c864b |
15 | 42ead8500b |
hex | 25951c4d9b |
161415450011 has 2 divisors, whose sum is σ = 161415450012. Its totient is φ = 161415450010.
The previous prime is 161415449983. The next prime is 161415450013. The reversal of 161415450011 is 110054514161.
161415450011 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 an emirp because it is prime and its reverse (110054514161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 161415450011 - 26 = 161415449947 is a prime.
Together with 161415450013, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (161415450013) 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, 80707725005 + 80707725006.
It is an arithmetic number, because the mean of its divisors is an integer number (80707725006).
Almost surely, 2161415450011 is an apocalyptic number.
161415450011 is a deficient number, since it is larger than the sum of its proper divisors (1).
161415450011 is an equidigital number, since it uses as much as digits as its factorization.
161415450011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 29.
Adding to 161415450011 its reverse (110054514161), we get a palindrome (271469964172).
The spelling of 161415450011 in words is "one hundred sixty-one billion, four hundred fifteen million, four hundred fifty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •