Base | Representation |
---|---|
bin | 100100011001001111110… |
… | …1101110100100011010101 |
3 | 122201012002110222001202100 |
4 | 1020302133231310203111 |
5 | 1123423120002142441 |
6 | 14345521424432313 |
7 | 1024245520261155 |
oct | 110623755644325 |
9 | 18635073861670 |
10 | 5002021521621 |
11 | 1659388823693 |
12 | 689512a78699 |
13 | 2a38c4b354c7 |
14 | 134156044765 |
15 | 8a1a9e35cb6 |
hex | 48c9fb748d5 |
5002021521621 has 12 divisors (see below), whose sum is σ = 7231419486720. Its totient is φ = 3331783804200.
The previous prime is 5002021521619. The next prime is 5002021521643. The reversal of 5002021521621 is 1261251202005.
5002021521621 is a `hidden beast` number, since 5 + 0 + 0 + 2 + 0 + 2 + 15 + 21 + 621 = 666.
It is not a de Polignac number, because 5002021521621 - 21 = 5002021521619 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5002021521691) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 241423251 + ... + 241443968.
It is an arithmetic number, because the mean of its divisors is an integer number (602618290560).
Almost surely, 25002021521621 is an apocalyptic number.
It is an amenable number.
5002021521621 is a deficient number, since it is larger than the sum of its proper divisors (2229397965099).
5002021521621 is a wasteful number, since it uses less digits than its factorization.
5002021521621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482868376 (or 482868373 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 5002021521621 its reverse (1261251202005), we get a palindrome (6263272723626).
The spelling of 5002021521621 in words is "five trillion, two billion, twenty-one million, five hundred twenty-one thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •