Base | Representation |
---|---|
bin | 11101000110110110011… |
… | …01010000111011111100 |
3 | 10112121110101121002120222 |
4 | 32203123031100323330 |
5 | 112341211141201340 |
6 | 2043235542200512 |
7 | 132153442405640 |
oct | 16433315207374 |
9 | 3477411532528 |
10 | 1000110100220 |
11 | 356165095910 |
12 | 1419b2a23138 |
13 | 734050376ba |
14 | 36596d06c20 |
15 | 1b0362638b5 |
hex | e8db350efc |
1000110100220 has 96 divisors (see below), whose sum is σ = 2708762273280. Its totient is φ = 300973559040.
The previous prime is 1000110100219. The next prime is 1000110100277. The reversal of 1000110100220 is 220010110001.
It is a junction number, because it is equal to n+sod(n) for n = 1000110100198 and 1000110100207.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11152274 + ... + 11241593.
It is an arithmetic number, because the mean of its divisors is an integer number (28216273680).
Almost surely, 21000110100220 is an apocalyptic number.
1000110100220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1000110100220 is an abundant number, since it is smaller than the sum of its proper divisors (1708652173060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000110100220 is a wasteful number, since it uses less digits than its factorization.
1000110100220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22393923 (or 22393921 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1000110100220 its reverse (220010110001), we get a palindrome (1220120210221).
The spelling of 1000110100220 in words is "one trillion, one hundred ten million, one hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •