Base | Representation |
---|---|
bin | 10101001111110110… |
… | …11000001010111001 |
3 | 1002102222211122011101 |
4 | 22213323120022321 |
5 | 141330231421121 |
6 | 5123533531401 |
7 | 552453260203 |
oct | 124773301271 |
9 | 32388748141 |
10 | 11407295161 |
11 | 4924136769 |
12 | 2264343b61 |
13 | 10ca4215c2 |
14 | 7a3013773 |
15 | 46b6e4491 |
hex | 2a7ed82b9 |
11407295161 has 2 divisors, whose sum is σ = 11407295162. Its totient is φ = 11407295160.
The previous prime is 11407295149. The next prime is 11407295191. The reversal of 11407295161 is 16159270411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7130789136 + 4276506025 = 84444^2 + 65395^2 .
It is a cyclic number.
It is not a de Polignac number, because 11407295161 - 29 = 11407294649 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11407295161.
It is not a weakly prime, because it can be changed into another prime (11407295131) 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, 5703647580 + 5703647581.
It is an arithmetic number, because the mean of its divisors is an integer number (5703647581).
Almost surely, 211407295161 is an apocalyptic number.
It is an amenable number.
11407295161 is a deficient number, since it is larger than the sum of its proper divisors (1).
11407295161 is an equidigital number, since it uses as much as digits as its factorization.
11407295161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 37.
The spelling of 11407295161 in words is "eleven billion, four hundred seven million, two hundred ninety-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •