Base | Representation |
---|---|
bin | 1001001001010001111111… |
… | …11101101101100101110001 |
3 | 2122012111201010220011211202 |
4 | 10210220333331231211301 |
5 | 10113441001131201001 |
6 | 110434242414020545 |
7 | 4143623162535116 |
oct | 444507775554561 |
9 | 78174633804752 |
10 | 20110110022001 |
11 | 645371692431a |
12 | 23095831a7755 |
13 | b2b4b5522ccc |
14 | 4d7497cc090d |
15 | 24d19b96296b |
hex | 124a3ff6d971 |
20110110022001 has 4 divisors (see below), whose sum is σ = 21293057670372. Its totient is φ = 18927162373632.
The previous prime is 20110110021961. The next prime is 20110110022061. The reversal of 20110110022001 is 10022001101102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 15007372384225 + 5102737637776 = 3873935^2 + 2258924^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20110110022001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20110110022061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 591473824160 + ... + 591473824193.
It is an arithmetic number, because the mean of its divisors is an integer number (5323264417593).
Almost surely, 220110110022001 is an apocalyptic number.
It is an amenable number.
20110110022001 is a deficient number, since it is larger than the sum of its proper divisors (1182947648371).
20110110022001 is a wasteful number, since it uses less digits than its factorization.
20110110022001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1182947648370.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20110110022001 its reverse (10022001101102), we get a palindrome (30132111123103).
The spelling of 20110110022001 in words is "twenty trillion, one hundred ten billion, one hundred ten million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •