Base | Representation |
---|---|
bin | 10100110001100100… |
… | …01000111001111101 |
3 | 1001210021202000211210 |
4 | 22120302020321331 |
5 | 140320210340401 |
6 | 5042420035033 |
7 | 543246523050 |
oct | 123062107175 |
9 | 31707660753 |
10 | 11153215101 |
11 | 4803776646 |
12 | 21b3232a79 |
13 | 10898b0a82 |
14 | 77b394a97 |
15 | 4542564d6 |
hex | 298c88e7d |
11153215101 has 16 divisors (see below), whose sum is σ = 17002150400. Its totient is φ = 6370725168.
The previous prime is 11153215097. The next prime is 11153215163. The reversal of 11153215101 is 10151235111.
11153215101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11153215101 - 22 = 11153215097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11153215201) 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 15 ways as a sum of consecutive naturals, for example, 51271 + ... + 157908.
It is an arithmetic number, because the mean of its divisors is an integer number (1062634400).
Almost surely, 211153215101 is an apocalyptic number.
It is an amenable number.
11153215101 is a deficient number, since it is larger than the sum of its proper divisors (5848935299).
11153215101 is a wasteful number, since it uses less digits than its factorization.
11153215101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211728.
The product of its (nonzero) digits is 150, while the sum is 21.
The spelling of 11153215101 in words is "eleven billion, one hundred fifty-three million, two hundred fifteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •