Base | Representation |
---|---|
bin | 1010000000010101111101… |
… | …0010110011110001010100 |
3 | 1102221200112022011120020101 |
4 | 2200011133102303301110 |
5 | 2420220032030324340 |
6 | 35221443315343444 |
7 | 2213540166141415 |
oct | 240053722636124 |
9 | 42850468146211 |
10 | 11001010011220 |
11 | 35615583a0329 |
12 | 129809bbb1b84 |
13 | 61a510757c28 |
14 | 2a064776b80c |
15 | 1412651b6c9a |
hex | a015f4b3c54 |
11001010011220 has 48 divisors (see below), whose sum is σ = 23260295697408. Its totient is φ = 4370302085760.
The previous prime is 11001010011197. The next prime is 11001010011239. The reversal of 11001010011220 is 2211001010011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 11001010011197 and 11001010011206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5798719 + ... + 7458361.
It is an arithmetic number, because the mean of its divisors is an integer number (484589493696).
Almost surely, 211001010011220 is an apocalyptic number.
11001010011220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11001010011220 is an abundant number, since it is smaller than the sum of its proper divisors (12259285686188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001010011220 is a wasteful number, since it uses less digits than its factorization.
11001010011220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1661920 (or 1661918 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11001010011220 its reverse (2211001010011), we get a palindrome (13212011021231).
The spelling of 11001010011220 in words is "eleven trillion, one billion, ten million, eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •