Base | Representation |
---|---|
bin | 11101011101000010001… |
… | …10000000001100101010 |
3 | 10120202012102012201010100 |
4 | 32232201012000030222 |
5 | 113040104111120020 |
6 | 2052525433130230 |
7 | 133054541144106 |
oct | 16564106001452 |
9 | 3522172181110 |
10 | 1012020020010 |
11 | 360216a1092a |
12 | 144177559976 |
13 | 7458261c90c |
14 | 36da6996906 |
15 | 1b4d1b3da90 |
hex | eba118032a |
1012020020010 has 24 divisors (see below), whose sum is σ = 2631252052260. Its totient is φ = 269872005312.
The previous prime is 1012020019999. The next prime is 1012020020017. The reversal of 1012020020010 is 100200202101.
It can be written as a sum of positive squares in 2 ways, for example, as 1005248869641 + 6771150369 = 1002621^2 + 82287^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1012020019974 and 1012020020001.
It is not an unprimeable number, because it can be changed into a prime (1012020020017) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5622333355 + ... + 5622333534.
Almost surely, 21012020020010 is an apocalyptic number.
1012020020010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1012020020010 is an abundant number, since it is smaller than the sum of its proper divisors (1619232032250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012020020010 is a wasteful number, since it uses less digits than its factorization.
1012020020010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11244666902 (or 11244666899 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1012020020010 its reverse (100200202101), we get a palindrome (1112220222111).
The spelling of 1012020020010 in words is "one trillion, twelve billion, twenty million, twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •