Base | Representation |
---|---|
bin | 1001001100000000111000… |
… | …1011111110110011000100 |
3 | 1022202202000211022002222201 |
4 | 2103000032023332303010 |
5 | 2311002344240231040 |
6 | 33252443434404244 |
7 | 2061563001404422 |
oct | 223001613766304 |
9 | 38682024262881 |
10 | 10102001102020 |
11 | 3245264299743 |
12 | 1171a03890684 |
13 | 5837cb409aa9 |
14 | 26cd21c54112 |
15 | 127b99baba9a |
hex | 9300e2fecc4 |
10102001102020 has 48 divisors (see below), whose sum is σ = 21962357077248. Its totient is φ = 3900650238720.
The previous prime is 10102001102003. The next prime is 10102001102057. The reversal of 10102001102020 is 2020110020101.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 10102001101988 and 10102001102006.
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, 73539666 + ... + 73676905.
It is an arithmetic number, because the mean of its divisors is an integer number (457549105776).
Almost surely, 210102001102020 is an apocalyptic number.
10102001102020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10102001102020 is an abundant number, since it is smaller than the sum of its proper divisors (11860355975228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102001102020 is a wasteful number, since it uses less digits than its factorization.
10102001102020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147216700 (or 147216698 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10102001102020 its reverse (2020110020101), we get a palindrome (12122111122121).
The spelling of 10102001102020 in words is "ten trillion, one hundred two billion, one million, one hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •