Base | Representation |
---|---|
bin | 1001000111010011001011… |
… | …0111000111101111110100 |
3 | 1022110222222120001001120210 |
4 | 2101310302313013233310 |
5 | 2303141013033341040 |
6 | 33151331145225420 |
7 | 2052665006451462 |
oct | 221646267075764 |
9 | 38428876031523 |
10 | 10021012012020 |
11 | 3213984040709 |
12 | 115a180792270 |
13 | 578c923b7929 |
14 | 26903b9ab832 |
15 | 125a09964480 |
hex | 91d32dc7bf4 |
10021012012020 has 48 divisors (see below), whose sum is σ = 28588245598080. Its totient is φ = 2621849682816.
The previous prime is 10021012012009. The next prime is 10021012012061. The reversal of 10021012012020 is 2021021012001.
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 = 10021012011987 and 10021012012005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1575627640 + ... + 1575633999.
It is an arithmetic number, because the mean of its divisors is an integer number (595588449960).
Almost surely, 210021012012020 is an apocalyptic number.
10021012012020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10021012012020 is an abundant number, since it is smaller than the sum of its proper divisors (18567233586060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10021012012020 is a wasteful number, since it uses less digits than its factorization.
10021012012020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3151261704 (or 3151261702 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10021012012020 its reverse (2021021012001), we get a palindrome (12042033024021).
The spelling of 10021012012020 in words is "ten trillion, twenty-one billion, twelve million, twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •