Base | Representation |
---|---|
bin | 1001000111001111011110… |
… | …1111010110100111001010 |
3 | 1022110220102102121201112200 |
4 | 2101303313233112213022 |
5 | 2303132000122320020 |
6 | 33151044513421030 |
7 | 2052631303510155 |
oct | 221636757264712 |
9 | 38426372551480 |
10 | 10020020120010 |
11 | 321351515554a |
12 | 1159b4456a776 |
13 | 578b64a59094 |
14 | 268d85d70c9c |
15 | 12599c835590 |
hex | 91cf7bd69ca |
10020020120010 has 48 divisors (see below), whose sum is σ = 26052225440904. Its totient is φ = 2671987608576.
The previous prime is 10020020119951. The next prime is 10020020120023. The reversal of 10020020120010 is 1002102002001.
It can be written as a sum of positive squares in 4 ways, for example, as 5214020596929 + 4805999523081 = 2283423^2 + 2192259^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 = 10020020119974 and 10020020120001.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18652534 + ... + 19182206.
Almost surely, 210020020120010 is an apocalyptic number.
10020020120010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10020020120010 is an abundant number, since it is smaller than the sum of its proper divisors (16032205320894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10020020120010 is a wasteful number, since it uses less digits than its factorization.
10020020120010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 739879 (or 739876 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10020020120010 its reverse (1002102002001), we get a palindrome (11022122122011).
The spelling of 10020020120010 in words is "ten trillion, twenty billion, twenty million, one hundred twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •