Base | Representation |
---|---|
bin | 1010000000111011111101… |
… | …0001001000111100110010 |
3 | 1102222122212011110211101110 |
4 | 2200032333101020330302 |
5 | 2420401424242333020 |
6 | 35230251411214150 |
7 | 2214351023506011 |
oct | 240167721107462 |
9 | 42878764424343 |
10 | 11011210121010 |
11 | 3565912062830 |
12 | 129a067ba7356 |
13 | 61b477a3a658 |
14 | 2a0d34300a78 |
15 | 1416609018e0 |
hex | a03bf448f32 |
11011210121010 has 128 divisors (see below), whose sum is σ = 30353929943040. Its totient is φ = 2528286566400.
The previous prime is 11011210120969. The next prime is 11011210121053. The reversal of 11011210121010 is 1012101211011.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 26320834 + ... + 26735906.
It is an arithmetic number, because the mean of its divisors is an integer number (237140077680).
Almost surely, 211011210121010 is an apocalyptic number.
11011210121010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11011210121010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15176964971520).
11011210121010 is an abundant number, since it is smaller than the sum of its proper divisors (19342719822030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011210121010 is a wasteful number, since it uses less digits than its factorization.
11011210121010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419344.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11011210121010 its reverse (1012101211011), we get a palindrome (12023311332021).
The spelling of 11011210121010 in words is "eleven trillion, eleven billion, two hundred ten million, one hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •