Base | Representation |
---|---|
bin | 10100101010110000… |
… | …10100011110011110 |
3 | 1001122022022001101000 |
4 | 22111120110132132 |
5 | 140211101140402 |
6 | 5033020131130 |
7 | 541654264542 |
oct | 122530243636 |
9 | 31568261330 |
10 | 11096115102 |
11 | 4784516566 |
12 | 2198096aa6 |
13 | 107ab0aaa7 |
14 | 77396da22 |
15 | 44e227c1c |
hex | 29561479e |
11096115102 has 32 divisors (see below), whose sum is σ = 25955827200. Its totient is φ = 3504036024.
The previous prime is 11096115097. The next prime is 11096115103. The reversal of 11096115102 is 20151169011.
11096115102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11096115103) 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, 5406438 + ... + 5408489.
It is an arithmetic number, because the mean of its divisors is an integer number (811119600).
Almost surely, 211096115102 is an apocalyptic number.
11096115102 is an abundant number, since it is smaller than the sum of its proper divisors (14859712098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11096115102 is a wasteful number, since it uses less digits than its factorization.
11096115102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10814957 (or 10814951 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 27.
The spelling of 11096115102 in words is "eleven billion, ninety-six million, one hundred fifteen thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •