Base | Representation |
---|---|
bin | 11110100100101101011… |
… | …011111010110000011100 |
3 | 21102212001101121112222202 |
4 | 132210231123322300130 |
5 | 233410322313113040 |
6 | 4245104153231032 |
7 | 304535525253356 |
oct | 36445533726034 |
9 | 7385041545882 |
10 | 2101001301020 |
11 | 740036509196 |
12 | 29b231102478 |
13 | 12317b64820b |
14 | 739908ba0d6 |
15 | 399ba0a4015 |
hex | 1e92d6fac1c |
2101001301020 has 48 divisors (see below), whose sum is σ = 4535536275648. Its totient is φ = 817213662720.
The previous prime is 2101001301013. The next prime is 2101001301041. The reversal of 2101001301020 is 201031001012.
It is a junction number, because it is equal to n+sod(n) for n = 2101001300992 and 2101001301010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10030439 + ... + 10237758.
It is an arithmetic number, because the mean of its divisors is an integer number (94490339076).
Almost surely, 22101001301020 is an apocalyptic number.
2101001301020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2101001301020 is an abundant number, since it is smaller than the sum of its proper divisors (2434534974628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101001301020 is a wasteful number, since it uses less digits than its factorization.
2101001301020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20268350 (or 20268348 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 2101001301020 its reverse (201031001012), we get a palindrome (2302032302032).
The spelling of 2101001301020 in words is "two trillion, one hundred one billion, one million, three hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •