Base | Representation |
---|---|
bin | 1001001001000001000011… |
… | …01100010100010110101111 |
3 | 2122011122020002202111112011 |
4 | 10210200201230110112233 |
5 | 10113313333111223434 |
6 | 110430135540222051 |
7 | 4143151551450130 |
oct | 444404154242657 |
9 | 78148202674464 |
10 | 20101012211119 |
11 | 644a8783a7354 |
12 | 230786439a927 |
13 | b2a695717768 |
14 | 4d6c738c7c87 |
15 | 24cd17db4e64 |
hex | 124821b145af |
20101012211119 has 12 divisors (see below), whose sum is σ = 24403403853424. Its totient is φ = 16215942622464.
The previous prime is 20101012211083. The next prime is 20101012211129. The reversal of 20101012211119 is 91111221010102.
It is a happy number.
It is not a de Polignac number, because 20101012211119 - 27 = 20101012210991 is a prime.
It is a super-2 number, since 2×201010122111192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20101012211119.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20101012211129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4968117654 + ... + 4968121699.
Almost surely, 220101012211119 is an apocalyptic number.
20101012211119 is a deficient number, since it is larger than the sum of its proper divisors (4302391642305).
20101012211119 is an equidigital number, since it uses as much as digits as its factorization.
20101012211119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9936239394 (or 9936239377 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 20101012211119 in words is "twenty trillion, one hundred one billion, twelve million, two hundred eleven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •