Base | Representation |
---|---|
bin | 1001000110011101010110… |
… | …10111010001001000101111 |
3 | 2121212020101021102111010002 |
4 | 10203032223113101020233 |
5 | 10110343341133314003 |
6 | 110321523124534515 |
7 | 4133620650051452 |
oct | 443165327211057 |
9 | 77766337374102 |
10 | 20013127635503 |
11 | 6416579899982 |
12 | 22b2817b5143b |
13 | b222cac53bb2 |
14 | 4d28d792d499 |
15 | 24a8c25eaa88 |
hex | 1233ab5d122f |
20013127635503 has 4 divisors (see below), whose sum is σ = 20013230755368. Its totient is φ = 20013024515640.
The previous prime is 20013127635491. The next prime is 20013127635533. The reversal of 20013127635503 is 30553672131002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20013127635503 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 (20013127635533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51268268 + ... + 51657153.
It is an arithmetic number, because the mean of its divisors is an integer number (5003307688842).
Almost surely, 220013127635503 is an apocalyptic number.
20013127635503 is a deficient number, since it is larger than the sum of its proper divisors (103119865).
20013127635503 is a wasteful number, since it uses less digits than its factorization.
20013127635503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103119864.
The product of its (nonzero) digits is 113400, while the sum is 38.
Adding to 20013127635503 its reverse (30553672131002), we get a palindrome (50566799766505).
The spelling of 20013127635503 in words is "twenty trillion, thirteen billion, one hundred twenty-seven million, six hundred thirty-five thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •