Base | Representation |
---|---|
bin | 1001000110010111100010… |
… | …00000100001100000110101 |
3 | 2121211221022101022120220201 |
4 | 10203023301000201200311 |
5 | 10110320440241023333 |
6 | 110320245000400501 |
7 | 4133450324042110 |
oct | 443136100414065 |
9 | 77757271276821 |
10 | 20010001111093 |
11 | 6415214a70904 |
12 | 22b20a4a76131 |
13 | b21c2029cb56 |
14 | 4d26bc5cd577 |
15 | 24a78cdb317d |
hex | 1232f1021835 |
20010001111093 has 16 divisors (see below), whose sum is σ = 23028564049920. Its totient is φ = 17031750548400.
The previous prime is 20010001111063. The next prime is 20010001111159. The reversal of 20010001111093 is 39011110001002.
It is not a de Polignac number, because 20010001111093 - 29 = 20010001110581 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 20010001111093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20010001111063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12341953 + ... + 13868806.
It is an arithmetic number, because the mean of its divisors is an integer number (1439285253120).
Almost surely, 220010001111093 is an apocalyptic number.
It is an amenable number.
20010001111093 is a deficient number, since it is larger than the sum of its proper divisors (3018562938827).
20010001111093 is a wasteful number, since it uses less digits than its factorization.
20010001111093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26211528.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 20010001111093 its reverse (39011110001002), we get a palindrome (59021111112095).
The spelling of 20010001111093 in words is "twenty trillion, ten billion, one million, one hundred eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •