Base | Representation |
---|---|
bin | 100100100001110000111… |
… | …1000101000010100010101 |
3 | 122202221022010211021111110 |
4 | 1021003201320220110111 |
5 | 1124223044222124113 |
6 | 14402144350525233 |
7 | 1025463666560151 |
oct | 111034170502425 |
9 | 18687263737443 |
10 | 5020311520533 |
11 | 1666113a79571 |
12 | 690b78206819 |
13 | 2a554b17167a |
14 | 134dad1a0061 |
15 | 8a8ca9c4bc3 |
hex | 490e1e28515 |
5020311520533 has 16 divisors (see below), whose sum is σ = 6715378897920. Its totient is φ = 3336072710256.
The previous prime is 5020311520519. The next prime is 5020311520537. The reversal of 5020311520533 is 3350251130205.
It is not a de Polignac number, because 5020311520533 - 228 = 5020043085077 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5020311520533.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5020311520537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 190285 + ... + 3174402.
It is an arithmetic number, because the mean of its divisors is an integer number (419711181120).
Almost surely, 25020311520533 is an apocalyptic number.
It is an amenable number.
5020311520533 is a deficient number, since it is larger than the sum of its proper divisors (1695067377387).
5020311520533 is a wasteful number, since it uses less digits than its factorization.
5020311520533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3366296.
The product of its (nonzero) digits is 13500, while the sum is 30.
Adding to 5020311520533 its reverse (3350251130205), we get a palindrome (8370562650738).
The spelling of 5020311520533 in words is "five trillion, twenty billion, three hundred eleven million, five hundred twenty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.932 sec. • engine limits •