Base | Representation |
---|---|
bin | 1010000000111110111100… |
… | …0100000100011011110100 |
3 | 1102222201221001100112221210 |
4 | 2200033233010010123310 |
5 | 2420410100033013022 |
6 | 35230503134241420 |
7 | 2214406631412411 |
oct | 240175704043364 |
9 | 42881831315853 |
10 | 11012012001012 |
11 | 3566193768080 |
12 | 129a250656270 |
13 | 61b574bcb169 |
14 | 2a0dac9d9108 |
15 | 1416aaeeaa0c |
hex | a03ef1046f4 |
11012012001012 has 48 divisors (see below), whose sum is σ = 28063284080832. Its totient is φ = 3333079514880.
The previous prime is 11012012000999. The next prime is 11012012001013. The reversal of 11012012001012 is 21010021021011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012012001013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48559183 + ... + 48785430.
It is an arithmetic number, because the mean of its divisors is an integer number (584651751684).
Almost surely, 211012012001012 is an apocalyptic number.
11012012001012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11012012001012 is an abundant number, since it is smaller than the sum of its proper divisors (17051272079820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012012001012 is a wasteful number, since it uses less digits than its factorization.
11012012001012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97345488 (or 97345486 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11012012001012 its reverse (21010021021011), we get a palindrome (32022033022023).
The spelling of 11012012001012 in words is "eleven trillion, twelve billion, twelve million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •