Base | Representation |
---|---|
bin | 10010101000010011… |
… | …010011000000010101 |
3 | 1220122002010002102100 |
4 | 102220103103000111 |
5 | 311431344000203 |
6 | 13104532232313 |
7 | 1305463642065 |
oct | 225023230025 |
9 | 56562102370 |
10 | 20003500053 |
11 | 85354aa729 |
12 | 3a6316b699 |
13 | 1b6a331a84 |
14 | d7a9573a5 |
15 | 7c120cea3 |
hex | 4a84d3015 |
20003500053 has 12 divisors (see below), whose sum is σ = 28896566400. Its totient is φ = 13334456616.
The previous prime is 20003500009. The next prime is 20003500057. The reversal of 20003500053 is 35000530002.
It is not a de Polignac number, because 20003500053 - 221 = 20001402901 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20003499999 and 20003500035.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20003500057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10300 + ... + 200282.
It is an arithmetic number, because the mean of its divisors is an integer number (2408047200).
Almost surely, 220003500053 is an apocalyptic number.
It is an amenable number.
20003500053 is a deficient number, since it is larger than the sum of its proper divisors (8893066347).
20003500053 is a wasteful number, since it uses less digits than its factorization.
20003500053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201688 (or 201685 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 18.
It can be divided in two parts, 2000 and 3500053, that added together give a palindrome (3502053).
The spelling of 20003500053 in words is "twenty billion, three million, five hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •