Base | Representation |
---|---|
bin | 111000111101010000010100… |
… | …0001111001101100001110101 |
3 | 2102200220010121211001100120020 |
4 | 1301322200220033031201311 |
5 | 1011131341020134020041 |
6 | 4533312122033355353 |
7 | 210346025354530260 |
oct | 16172405017154165 |
9 | 2380803554040506 |
10 | 501000020220021 |
11 | 1356a7a08409323 |
12 | 482351b1108b59 |
13 | 18672139bbbb2a |
14 | 8ba075d447cd7 |
15 | 3cdc260d0a866 |
hex | 1c7a8283cd875 |
501000020220021 has 8 divisors (see below), whose sum is σ = 763428602240064. Its totient is φ = 286285725840000.
The previous prime is 501000020219957. The next prime is 501000020220043. The reversal of 501000020220021 is 120022020000105.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 501000020220021 - 26 = 501000020219957 is a prime.
It is a super-2 number, since 2×5010000202200212 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (501000020228021) 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, 11928571909980 + ... + 11928571910021.
It is an arithmetic number, because the mean of its divisors is an integer number (95428575280008).
Almost surely, 2501000020220021 is an apocalyptic number.
It is an amenable number.
501000020220021 is a deficient number, since it is larger than the sum of its proper divisors (262428582020043).
501000020220021 is a wasteful number, since it uses less digits than its factorization.
501000020220021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23857143820011.
The product of its (nonzero) digits is 80, while the sum is 15.
Adding to 501000020220021 its reverse (120022020000105), we get a palindrome (621022040220126).
The spelling of 501000020220021 in words is "five hundred one trillion, twenty million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •