Base | Representation |
---|---|
bin | 1001000110001001001101… |
… | …00101101100011101010111 |
3 | 2121211012110101100102002121 |
4 | 10203010212211230131113 |
5 | 10110204212342104421 |
6 | 110312533455520411 |
7 | 4133055614453344 |
oct | 443044645543527 |
9 | 77735411312077 |
10 | 20002310113111 |
11 | 6411a28666227 |
12 | 22b06b9229107 |
13 | b21295a8a081 |
14 | 4d218cd9d7cb |
15 | 24a48caa3d41 |
hex | 12312696c757 |
20002310113111 has 8 divisors (see below), whose sum is σ = 20491555213584. Its totient is φ = 19513130911680.
The previous prime is 20002310113109. The next prime is 20002310113117. The reversal of 20002310113111 is 11131101320002.
It is a happy number.
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 20002310113111 - 21 = 20002310113109 is a prime.
It is a super-2 number, since 2×200023101131112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002310113117) 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, 15860001 + ... + 17074666.
It is an arithmetic number, because the mean of its divisors is an integer number (2561444401698).
Almost surely, 220002310113111 is an apocalyptic number.
20002310113111 is a deficient number, since it is larger than the sum of its proper divisors (489245100473).
20002310113111 is a wasteful number, since it uses less digits than its factorization.
20002310113111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32949521.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 20002310113111 its reverse (11131101320002), we get a palindrome (31133411433113).
The spelling of 20002310113111 in words is "twenty trillion, two billion, three hundred ten million, one hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •