Base | Representation |
---|---|
bin | 1001000110010111111001… |
… | …11011110110010011001111 |
3 | 2121211221211022211202220112 |
4 | 10203023330323312103033 |
5 | 10110321343002241421 |
6 | 110320320505310235 |
7 | 4133455303630025 |
oct | 443137473662317 |
9 | 77757738752815 |
10 | 20010201212111 |
11 | 6415307a12750 |
12 | 22b213ba9537b |
13 | b21c52891116 |
14 | 4d26dadda715 |
15 | 24a7a073c45b |
hex | 1232fcef64cf |
20010201212111 has 8 divisors (see below), whose sum is σ = 22533481717248. Its totient is φ = 17604282591000.
The previous prime is 20010201212087. The next prime is 20010201212137. The reversal of 20010201212111 is 11121210201002.
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 20010201212111 - 238 = 19735323305167 is a prime.
It is a super-2 number, since 2×200102012121112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20010201212161) 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, 29340470645 + ... + 29340471326.
It is an arithmetic number, because the mean of its divisors is an integer number (2816685214656).
Almost surely, 220010201212111 is an apocalyptic number.
20010201212111 is a deficient number, since it is larger than the sum of its proper divisors (2523280505137).
20010201212111 is a wasteful number, since it uses less digits than its factorization.
20010201212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58680942013.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20010201212111 its reverse (11121210201002), we get a palindrome (31131411413113).
The spelling of 20010201212111 in words is "twenty trillion, ten billion, two hundred one million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •