Base | Representation |
---|---|
bin | 1001001010110101000111… |
… | …10010000111001010001101 |
3 | 2122101121001201222002220002 |
4 | 10211122203302013022031 |
5 | 10120323442010411112 |
6 | 110514523040534045 |
7 | 4150515654530300 |
oct | 445324362071215 |
9 | 78347051862802 |
10 | 20163324310157 |
11 | 6474243a09666 |
12 | 2317954621325 |
13 | b33516194b92 |
14 | 4d9ca5478b37 |
15 | 24e7635c91c2 |
hex | 1256a3c8728d |
20163324310157 has 24 divisors (see below), whose sum is σ = 23530680216576. Its totient is φ = 17227357179648.
The previous prime is 20163324310127. The next prime is 20163324310267. The reversal of 20163324310157 is 75101342336102.
It is not a de Polignac number, because 20163324310157 - 220 = 20163323261581 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20163324310157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20163324310127) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 30962333 + ... + 31606845.
It is an arithmetic number, because the mean of its divisors is an integer number (980445009024).
Almost surely, 220163324310157 is an apocalyptic number.
It is an amenable number.
20163324310157 is a deficient number, since it is larger than the sum of its proper divisors (3367355906419).
20163324310157 is a wasteful number, since it uses less digits than its factorization.
20163324310157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 646577 (or 646570 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 38.
Adding to 20163324310157 its reverse (75101342336102), we get a palindrome (95264666646259).
The spelling of 20163324310157 in words is "twenty trillion, one hundred sixty-three billion, three hundred twenty-four million, three hundred ten thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •