Base | Representation |
---|---|
bin | 1001001101000111101100… |
… | …00000000001011111101101 |
3 | 2122200010011200210210201101 |
4 | 10212203312000001133231 |
5 | 10123121120323200023 |
6 | 111015015154443101 |
7 | 4156302645311635 |
oct | 446436600013755 |
9 | 78603150723641 |
10 | 20242013100013 |
11 | 64a46537610a1 |
12 | 232b055293491 |
13 | b3aa767683b3 |
14 | 4dda0c0156c5 |
15 | 25181b8e11ad |
hex | 1268f60017ed |
20242013100013 has 8 divisors (see below), whose sum is σ = 21308222484000. Its totient is φ = 19175887743408.
The previous prime is 20242013100011. The next prime is 20242013100073. The reversal of 20242013100013 is 31000131024202.
It is a happy number.
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 20242013100013 - 21 = 20242013100011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20242013100011) 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, 20512063 + ... + 21476236.
It is an arithmetic number, because the mean of its divisors is an integer number (2663527810500).
Almost surely, 220242013100013 is an apocalyptic number.
It is an amenable number.
20242013100013 is a deficient number, since it is larger than the sum of its proper divisors (1066209383987).
20242013100013 is a wasteful number, since it uses less digits than its factorization.
20242013100013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42013691.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 20242013100013 its reverse (31000131024202), we get a palindrome (51242144124215).
The spelling of 20242013100013 in words is "twenty trillion, two hundred forty-two billion, thirteen million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •