Base | Representation |
---|---|
bin | 1001010010001011110000… |
… | …11101010100100100000101 |
3 | 2200021202021011211000022221 |
4 | 10221011320131110210011 |
5 | 10133443432112311323 |
6 | 111230551532452341 |
7 | 4205002345016500 |
oct | 451057035244405 |
9 | 80252234730287 |
10 | 20416000510213 |
11 | 65614170535a0 |
12 | 235891131a0b1 |
13 | b512b38265a9 |
14 | 5081d5486137 |
15 | 25610132655d |
hex | 129178754905 |
20416000510213 has 48 divisors (see below), whose sum is σ = 26721463258368. Its totient is φ = 15415930320000.
The previous prime is 20416000510193. The next prime is 20416000510219. The reversal of 20416000510213 is 31201500061402.
It is a happy number.
It is not a de Polignac number, because 20416000510213 - 25 = 20416000510181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20416000510219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1430998 + ... + 6548263.
It is an arithmetic number, because the mean of its divisors is an integer number (556697151216).
Almost surely, 220416000510213 is an apocalyptic number.
It is an amenable number.
20416000510213 is a deficient number, since it is larger than the sum of its proper divisors (6305462748155).
20416000510213 is a wasteful number, since it uses less digits than its factorization.
20416000510213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7979434 (or 7979427 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 20416000510213 its reverse (31201500061402), we get a palindrome (51617500571615).
The spelling of 20416000510213 in words is "twenty trillion, four hundred sixteen billion, five hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •