Base | Representation |
---|---|
bin | 1001001001010010001011… |
… | …11111101011100001001110 |
3 | 2122012111222012021121110212 |
4 | 10210221011333223201032 |
5 | 10113441203031413402 |
6 | 110434300430402422 |
7 | 4143625531540661 |
oct | 444510577534116 |
9 | 78174865247425 |
10 | 20110211201102 |
11 | 6453768a50710 |
12 | 23095b1060412 |
13 | b2b50048a3b9 |
14 | 4d74a74db6d8 |
15 | 24d1a579b952 |
hex | 124a45feb84e |
20110211201102 has 16 divisors (see below), whose sum is σ = 33607780422912. Its totient is φ = 8946515620920.
The previous prime is 20110211201027. The next prime is 20110211201107.
20110211201102 is nontrivially palindromic in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110211201107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9724472468 + ... + 9724474535.
It is an arithmetic number, because the mean of its divisors is an integer number (2100486276432).
Almost surely, 220110211201102 is an apocalyptic number.
20110211201102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20110211201102 is a deficient number, since it is larger than the sum of its proper divisors (13497569221810).
20110211201102 is a wasteful number, since it uses less digits than its factorization.
20110211201102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19448947063.
The product of its (nonzero) digits is 16, while the sum is 14.
It can be divided in two parts, 2011021 and 1201102, that added together give a palindrome (3212123).
The spelling of 20110211201102 in words is "twenty trillion, one hundred ten billion, two hundred eleven million, two hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •