Base | Representation |
---|---|
bin | 1001000110000110110010… |
… | …01101110010100101000101 |
3 | 2121211002002220201111011201 |
4 | 10203003121031302211011 |
5 | 10110144033033013333 |
6 | 110312201004502501 |
7 | 4133011502625244 |
oct | 443033115624505 |
9 | 77732086644151 |
10 | 20001012001093 |
11 | 6411421938482 |
12 | 22b03b654aa31 |
13 | b21119b63556 |
14 | 4d20a881095b |
15 | 24a413b3817d |
hex | 1230d9372945 |
20001012001093 has 8 divisors (see below), whose sum is σ = 20226227688576. Its totient is φ = 19776329370000.
The previous prime is 20001012001039. The next prime is 20001012001109. The reversal of 20001012001093 is 39010021010002.
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 20001012001093 - 213 = 20001011992901 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 20001012001093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20031012001093) 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, 133188633 + ... + 133338718.
It is an arithmetic number, because the mean of its divisors is an integer number (2528278461072).
Almost surely, 220001012001093 is an apocalyptic number.
It is an amenable number.
20001012001093 is a deficient number, since it is larger than the sum of its proper divisors (225215687483).
20001012001093 is a wasteful number, since it uses less digits than its factorization.
20001012001093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 266528195.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 20001012001093 its reverse (39010021010002), we get a palindrome (59011033011095).
The spelling of 20001012001093 in words is "twenty trillion, one billion, twelve million, one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •