Base | Representation |
---|---|
bin | 1001001001010001110100… |
… | …01000100110000000000001 |
3 | 2122012111110022211212122112 |
4 | 10210220322020212000001 |
5 | 10113440301111224301 |
6 | 110434225001345105 |
7 | 4143620564261333 |
oct | 444507210460001 |
9 | 78174408755575 |
10 | 20110012211201 |
11 | 6453676698650 |
12 | 2309556498195 |
13 | b2b49b197ab3 |
14 | 4d7488cdd453 |
15 | 24d1930919bb |
hex | 124a3a226001 |
20110012211201 has 8 divisors (see below), whose sum is σ = 21938330354304. Its totient is φ = 18281716603920.
The previous prime is 20110012211197. The next prime is 20110012211273. The reversal of 20110012211201 is 10211221001102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20110012211201 - 22 = 20110012211197 is a prime.
It is a super-3 number, since 3×201100122112013 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20110012219201) 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, 3740441 + ... + 7362806.
It is an arithmetic number, because the mean of its divisors is an integer number (2742291294288).
Almost surely, 220110012211201 is an apocalyptic number.
It is an amenable number.
20110012211201 is a deficient number, since it is larger than the sum of its proper divisors (1828318143103).
20110012211201 is a wasteful number, since it uses less digits than its factorization.
20110012211201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11267911.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20110012211201 its reverse (10211221001102), we get a palindrome (30321233212303).
The spelling of 20110012211201 in words is "twenty trillion, one hundred ten billion, twelve million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •