Base | Representation |
---|---|
bin | 10000001010111000101… |
… | …111011011001011101100 |
3 | 10221020012111201122011211 |
4 | 100022320233123023230 |
5 | 121201214424032340 |
6 | 2210251221524204 |
7 | 143165411450461 |
oct | 20127057331354 |
9 | 3836174648154 |
10 | 1111201002220 |
11 | 399291aa6821 |
12 | 15b436b73664 |
13 | 80a2a54b13a |
14 | 3bad4d3b668 |
15 | 1dd88ee65ea |
hex | 102b8bdb2ec |
1111201002220 has 24 divisors (see below), whose sum is σ = 2408797012608. Its totient is φ = 430142323200.
The previous prime is 1111201002217. The next prime is 1111201002227. The reversal of 1111201002220 is 222001021111.
It is a self number, because there is not a number n which added to its sum of digits gives 1111201002220.
It is not an unprimeable number, because it can be changed into a prime (1111201002227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 896129221 + ... + 896130460.
It is an arithmetic number, because the mean of its divisors is an integer number (100366542192).
Almost surely, 21111201002220 is an apocalyptic number.
1111201002220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1111201002220 is an abundant number, since it is smaller than the sum of its proper divisors (1297596010388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111201002220 is a wasteful number, since it uses less digits than its factorization.
1111201002220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1792259721 (or 1792259719 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1111201002220 its reverse (222001021111), we get a palindrome (1333202023331).
The spelling of 1111201002220 in words is "one trillion, one hundred eleven billion, two hundred one million, two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •