Base | Representation |
---|---|
bin | 1001001001010101111011… |
… | …01111000001010110101011 |
3 | 2122012201011012101020201011 |
4 | 10210222331233001112223 |
5 | 10114004311321200021 |
6 | 110435232032204351 |
7 | 4144026364105054 |
oct | 444527557012653 |
9 | 78181135336634 |
10 | 20112220100011 |
11 | 64545a9a16146 |
12 | 2309a719996b7 |
13 | b2b76072c090 |
14 | 4d761823172b |
15 | 24d271d1ade1 |
hex | 124abdbc15ab |
20112220100011 has 8 divisors (see below), whose sum is σ = 21659515991120. Its totient is φ = 18564953071392.
The previous prime is 20112220099987. The next prime is 20112220100083. The reversal of 20112220100011 is 11000102221102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20112220100011 - 215 = 20112220067243 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20112220099964 and 20112220100000.
It is not an unprimeable number, because it can be changed into a prime (20112220110011) 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, 5757441 + ... + 8565778.
It is an arithmetic number, because the mean of its divisors is an integer number (2707439498890).
Almost surely, 220112220100011 is an apocalyptic number.
20112220100011 is a deficient number, since it is larger than the sum of its proper divisors (1547295891109).
20112220100011 is a wasteful number, since it uses less digits than its factorization.
20112220100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14431245.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20112220100011 its reverse (11000102221102), we get a palindrome (31112322321113).
The spelling of 20112220100011 in words is "twenty trillion, one hundred twelve billion, two hundred twenty million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •