Base | Representation |
---|---|
bin | 10100100000100001… |
… | …00111110101010000 |
3 | 1001102022122200022020 |
4 | 22100100213311100 |
5 | 140022103224102 |
6 | 5020311011440 |
7 | 536562151653 |
oct | 122020476520 |
9 | 31368580266 |
10 | 11010211152 |
11 | 473aa82666 |
12 | 2173369b80 |
13 | 1066091355 |
14 | 7663ab89a |
15 | 446909bbc |
hex | 290427d50 |
11010211152 has 40 divisors (see below), whose sum is σ = 28667022336. Its totient is φ = 3641170176.
The previous prime is 11010211151. The next prime is 11010211153. The reversal of 11010211152 is 25111201011.
It is an interprime number because it is at equal distance from previous prime (11010211151) and next prime (11010211153).
It is a super-2 number, since 2×110102111522 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010211151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 896973 + ... + 909164.
Almost surely, 211010211152 is an apocalyptic number.
11010211152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11010211152 is an abundant number, since it is smaller than the sum of its proper divisors (17656811184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010211152 is a wasteful number, since it uses less digits than its factorization.
11010211152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1806275 (or 1806269 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 15.
Adding to 11010211152 its reverse (25111201011), we get a palindrome (36121412163).
The spelling of 11010211152 in words is "eleven billion, ten million, two hundred eleven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.524 sec. • engine limits •