Base | Representation |
---|---|
bin | 11101011101010111101… |
… | …01011010010101110100 |
3 | 10120202122222021211001210 |
4 | 32232223311122111310 |
5 | 113040441224020040 |
6 | 2052555351321420 |
7 | 133062156624423 |
oct | 16565365322564 |
9 | 3522588254053 |
10 | 1012200220020 |
11 | 3602a96aa860 |
12 | 144207980270 |
13 | 745b0a63842 |
14 | 36dc28a32ba |
15 | 1b4e2886480 |
hex | ebabd5a574 |
1012200220020 has 96 divisors (see below), whose sum is σ = 3126551218560. Its totient is φ = 242624757760.
The previous prime is 1012200220019. The next prime is 1012200220081. The reversal of 1012200220020 is 200220022101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 1012200219978 and 1012200220005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8557197 + ... + 8674676.
It is an arithmetic number, because the mean of its divisors is an integer number (32568241860).
Almost surely, 21012200220020 is an apocalyptic number.
1012200220020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1012200220020 is an abundant number, since it is smaller than the sum of its proper divisors (2114350998540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012200220020 is a wasteful number, since it uses less digits than its factorization.
1012200220020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17231985 (or 17231983 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 1012200220020 its reverse (200220022101), we get a palindrome (1212420242121).
The spelling of 1012200220020 in words is "one trillion, twelve billion, two hundred million, two hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •