Base | Representation |
---|---|
bin | 10100100000101111… |
… | …11111111101110100 |
3 | 1001102110021221001200 |
4 | 22100113333331310 |
5 | 140023102120022 |
6 | 5020420252500 |
7 | 536614455021 |
oct | 122027777564 |
9 | 31373257050 |
10 | 11012145012 |
11 | 47410835a0 |
12 | 2173b41130 |
13 | 10665ba64b |
14 | 766752548 |
15 | 446b8cbac |
hex | 2905fff74 |
11012145012 has 108 divisors (see below), whose sum is σ = 32258518656. Its totient is φ = 3140686080.
The previous prime is 11012144989. The next prime is 11012145019. The reversal of 11012145012 is 21054121011.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012145019) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 66333 + ... + 162555.
Almost surely, 211012145012 is an apocalyptic number.
11012145012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11012145012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16129259328).
11012145012 is an abundant number, since it is smaller than the sum of its proper divisors (21246373644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012145012 is a wasteful number, since it uses less digits than its factorization.
11012145012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96278 (or 96256 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 18.
Adding to 11012145012 its reverse (21054121011), we get a palindrome (32066266023).
The spelling of 11012145012 in words is "eleven billion, twelve million, one hundred forty-five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •