Base | Representation |
---|---|
bin | 1001010101000111000010… |
… | …11011011001011100001101 |
3 | 2200122100210100122001202100 |
4 | 10222203201123121130031 |
5 | 10142120341220031024 |
6 | 111345100540345313 |
7 | 4215162063265224 |
oct | 452434133313415 |
9 | 80570710561670 |
10 | 20516545861389 |
11 | 65a0022301046 |
12 | 23742b1845239 |
13 | b5a918309526 |
14 | 50d012b05cbb |
15 | 258a383867c9 |
hex | 12a8e16d970d |
20516545861389 has 48 divisors (see below), whose sum is σ = 32109207624000. Its totient is φ = 12579526084608.
The previous prime is 20516545861379. The next prime is 20516545861393. The reversal of 20516545861389 is 98316854561502.
20516545861389 is a `hidden beast` number, since 2 + 0 + 5 + 1 + 6 + 5 + 4 + 5 + 8 + 613 + 8 + 9 = 666.
It is not a de Polignac number, because 20516545861389 - 27 = 20516545861261 is a prime.
It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20516545861309) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 770199 + ... + 6451844.
It is an arithmetic number, because the mean of its divisors is an integer number (668941825500).
Almost surely, 220516545861389 is an apocalyptic number.
It is an amenable number.
20516545861389 is a deficient number, since it is larger than the sum of its proper divisors (11592661762611).
20516545861389 is a wasteful number, since it uses less digits than its factorization.
20516545861389 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7222554 (or 7222551 counting only the distinct ones).
The product of its (nonzero) digits is 62208000, while the sum is 63.
The spelling of 20516545861389 in words is "twenty trillion, five hundred sixteen billion, five hundred forty-five million, eight hundred sixty-one thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •