Base | Representation |
---|---|
bin | 111100001101000… |
… | …1010011101010101 |
3 | 12012210012221211222 |
4 | 1320122022131111 |
5 | 13114122441001 |
6 | 532242140125 |
7 | 101026526543 |
oct | 17032123525 |
9 | 5183187758 |
10 | 2020124501 |
11 | 94734248a |
12 | 484651645 |
13 | 2626a2355 |
14 | 152416d93 |
15 | bc53a61b |
hex | 7868a755 |
2020124501 has 8 divisors (see below), whose sum is σ = 2139364224. Its totient is φ = 1900930240.
The previous prime is 2020124497. The next prime is 2020124537. The reversal of 2020124501 is 1054210202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2020124501 - 22 = 2020124497 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2020124501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020124591) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 131636 + ... + 146178.
It is an arithmetic number, because the mean of its divisors is an integer number (267420528).
Almost surely, 22020124501 is an apocalyptic number.
It is an amenable number.
2020124501 is a deficient number, since it is larger than the sum of its proper divisors (119239723).
2020124501 is a wasteful number, since it uses less digits than its factorization.
2020124501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22731.
The product of its (nonzero) digits is 160, while the sum is 17.
The square root of 2020124501 is about 44945.7951425937. The cubic root of 2020124501 is about 1264.1328350506.
Adding to 2020124501 its reverse (1054210202), we get a palindrome (3074334703).
The spelling of 2020124501 in words is "two billion, twenty million, one hundred twenty-four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •