Base | Representation |
---|---|
bin | 10100100000011111… |
… | …10100110010111100 |
3 | 1001102022021001112212 |
4 | 22100033310302330 |
5 | 140022030031413 |
6 | 5020302315552 |
7 | 536560321340 |
oct | 122017646274 |
9 | 31368231485 |
10 | 11010002108 |
11 | 473a94a5a6 |
12 | 2173288bb8 |
13 | 106601a161 |
14 | 766355620 |
15 | 4468b7ca8 |
hex | 2903f4cbc |
11010002108 has 24 divisors (see below), whose sum is σ = 22488517632. Its totient is φ = 4618176624.
The previous prime is 11010002039. The next prime is 11010002141. The reversal of 11010002108 is 80120001011.
11010002108 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 (14).
It is a junction number, because it is equal to n+sod(n) for n = 11010002092 and 11010002101.
It is a congruent number.
It is an unprimeable number.
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, 4181816 + ... + 4184447.
It is an arithmetic number, because the mean of its divisors is an integer number (937021568).
Almost surely, 211010002108 is an apocalyptic number.
It is an amenable number.
11010002108 is an abundant number, since it is smaller than the sum of its proper divisors (11478515524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010002108 is a wasteful number, since it uses less digits than its factorization.
11010002108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8366321 (or 8366319 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11010002108 its reverse (80120001011), we get a palindrome (91130003119).
The spelling of 11010002108 in words is "eleven billion, ten million, two thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •