Base | Representation |
---|---|
bin | 1001000110101101111101… |
… | …0011011101011001101100 |
3 | 1022110001012012201102201010 |
4 | 2101223133103131121230 |
5 | 2303010032134020022 |
6 | 33142555454345220 |
7 | 2052162261563520 |
oct | 221533723353154 |
9 | 38401165642633 |
10 | 10011020220012 |
11 | 320a716a22469 |
12 | 11582524bb210 |
13 | 57805c312476 |
14 | 268770983d80 |
15 | 12562267850c |
hex | 91adf4dd66c |
10011020220012 has 24 divisors (see below), whose sum is σ = 26696053920256. Its totient is φ = 2860291491408.
The previous prime is 10011020219989. The next prime is 10011020220043. The reversal of 10011020220012 is 21002202011001.
It is a super-2 number, since 2×100110202200122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a self number, because there is not a number n which added to its sum of digits gives 10011020220012.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59589405988 + ... + 59589406155.
Almost surely, 210011020220012 is an apocalyptic number.
10011020220012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10011020220012 is an abundant number, since it is smaller than the sum of its proper divisors (16685033700244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10011020220012 is a wasteful number, since it uses less digits than its factorization.
10011020220012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119178812157 (or 119178812155 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10011020220012 its reverse (21002202011001), we get a palindrome (31013222231013).
The spelling of 10011020220012 in words is "ten trillion, eleven billion, twenty million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •