Base | Representation |
---|---|
bin | 10000000000110110110… |
… | …111011110011110111100 |
3 | 10220012102000012202200002 |
4 | 100000312313132132330 |
5 | 121012141111441340 |
6 | 2201310451453432 |
7 | 142334506600400 |
oct | 20006667363674 |
9 | 3805360182602 |
10 | 1100432140220 |
11 | 394766289376 |
12 | 1593305b7278 |
13 | 7ca02490a4a |
14 | 3b392a37100 |
15 | 1d9588b2715 |
hex | 10036dde7bc |
1100432140220 has 72 divisors (see below), whose sum is σ = 2693359453680. Its totient is φ = 376566677760.
The previous prime is 1100432140207. The next prime is 1100432140243. The reversal of 1100432140220 is 220412340011.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1100432140192 and 1100432140201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 567050 + ... + 1588209.
It is an arithmetic number, because the mean of its divisors is an integer number (37407770190).
Almost surely, 21100432140220 is an apocalyptic number.
1100432140220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1100432140220 is an abundant number, since it is smaller than the sum of its proper divisors (1592927313460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100432140220 is a wasteful number, since it uses less digits than its factorization.
1100432140220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2155803 (or 2155794 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 1100432140220 its reverse (220412340011), we get a palindrome (1320844480231).
The spelling of 1100432140220 in words is "one trillion, one hundred billion, four hundred thirty-two million, one hundred forty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •