Base | Representation |
---|---|
bin | 1001010000100110010001… |
… | …11011111111101100101011 |
3 | 2200002112122001212220221201 |
4 | 10220103020323333230223 |
5 | 10132100341113404033 |
6 | 111145541255545031 |
7 | 4201033231436050 |
oct | 450231073775453 |
9 | 80075561786851 |
10 | 20361516153643 |
11 | 65402a8055035 |
12 | 234a24668b177 |
13 | b4910c9c9552 |
14 | 50570735d027 |
15 | 2549b2e3347d |
hex | 1284c8effb2b |
20361516153643 has 8 divisors (see below), whose sum is σ = 23409647315712. Its totient is φ = 17348220776616.
The previous prime is 20361516153623. The next prime is 20361516153701. The reversal of 20361516153643 is 34635161516302.
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 20361516153643 - 25 = 20361516153611 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20361516153593 and 20361516153602.
It is not an unprimeable number, because it can be changed into a prime (20361516153623) 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, 8708945005 + ... + 8708947342.
It is an arithmetic number, because the mean of its divisors is an integer number (2926205914464).
Almost surely, 220361516153643 is an apocalyptic number.
20361516153643 is a deficient number, since it is larger than the sum of its proper divisors (3048131162069).
20361516153643 is a wasteful number, since it uses less digits than its factorization.
20361516153643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17417892521.
The product of its (nonzero) digits is 1166400, while the sum is 46.
Adding to 20361516153643 its reverse (34635161516302), we get a palindrome (54996677669945).
The spelling of 20361516153643 in words is "twenty trillion, three hundred sixty-one billion, five hundred sixteen million, one hundred fifty-three thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •