Base | Representation |
---|---|
bin | 11101101101110001111… |
… | …11111100100011101010 |
3 | 10121121102000100211110100 |
4 | 32312320333330203222 |
5 | 113212012310120020 |
6 | 2101013533330230 |
7 | 133523414322102 |
oct | 16667077744352 |
9 | 3547360324410 |
10 | 1021011020010 |
11 | 364010115243 |
12 | 145a66636976 |
13 | 7538626b567 |
14 | 375bab08202 |
15 | 1b85b13da90 |
hex | edb8ffc8ea |
1021011020010 has 24 divisors (see below), whose sum is σ = 2654628652260. Its totient is φ = 272269605312.
The previous prime is 1021011019993. The next prime is 1021011020119. The reversal of 1021011020010 is 100201101201.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 973452569769 + 47558450241 = 986637^2 + 218079^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1021011019974 and 1021011020001.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5672283355 + ... + 5672283534.
Almost surely, 21021011020010 is an apocalyptic number.
1021011020010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1021011020010 is an abundant number, since it is smaller than the sum of its proper divisors (1633617632250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021011020010 is a wasteful number, since it uses less digits than its factorization.
1021011020010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11344566902 (or 11344566899 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1021011020010 its reverse (100201101201), we get a palindrome (1121212121211).
The spelling of 1021011020010 in words is "one trillion, twenty-one billion, eleven million, twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •