Base | Representation |
---|---|
bin | 10100110010100100… |
… | …01011101100111001 |
3 | 1001210212112210120010 |
4 | 22121102023230321 |
5 | 140324333141121 |
6 | 5043320052133 |
7 | 543411110034 |
oct | 123122135471 |
9 | 31725483503 |
10 | 11161615161 |
11 | 4808493744 |
12 | 21b6004049 |
13 | 108b562318 |
14 | 77c54001b |
15 | 454d65376 |
hex | 29948bb39 |
11161615161 has 8 divisors (see below), whose sum is σ = 14887690560. Its totient is φ = 7438308272.
The previous prime is 11161615159. The next prime is 11161615163. The reversal of 11161615161 is 16151616111.
11161615161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11161615159) and next prime (11161615163).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11161615161 - 21 = 11161615159 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11161615163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 682701 + ... + 698858.
It is an arithmetic number, because the mean of its divisors is an integer number (1860961320).
Almost surely, 211161615161 is an apocalyptic number.
It is an amenable number.
11161615161 is a deficient number, since it is larger than the sum of its proper divisors (3726075399).
11161615161 is a wasteful number, since it uses less digits than its factorization.
11161615161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1384255.
The product of its digits is 1080, while the sum is 30.
The spelling of 11161615161 in words is "eleven billion, one hundred sixty-one million, six hundred fifteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •