Base | Representation |
---|---|
bin | 1001001000111111100011… |
… | …11100000001100010111101 |
3 | 2122011120011021011212200120 |
4 | 10210133301330001202331 |
5 | 10113310213010201023 |
6 | 110425524240045153 |
7 | 4143122652451623 |
oct | 444376174014275 |
9 | 78146137155616 |
10 | 20100211022013 |
11 | 644a4a71240a1 |
12 | 23076800037b9 |
13 | b2a598739575 |
14 | 4d6bd932d513 |
15 | 24ccbc8a58e3 |
hex | 1247f1f018bd |
20100211022013 has 32 divisors (see below), whose sum is σ = 27864376565760. Its totient is φ = 12872830944960.
The previous prime is 20100211022011. The next prime is 20100211022069. The reversal of 20100211022013 is 31022011200102.
It is not a de Polignac number, because 20100211022013 - 21 = 20100211022011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20100211021983 and 20100211022001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20100211022011) 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 31 ways as a sum of consecutive naturals, for example, 30621928 + ... + 31271438.
It is an arithmetic number, because the mean of its divisors is an integer number (870761767680).
Almost surely, 220100211022013 is an apocalyptic number.
It is an amenable number.
20100211022013 is a deficient number, since it is larger than the sum of its proper divisors (7764165543747).
20100211022013 is a wasteful number, since it uses less digits than its factorization.
20100211022013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651337.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 20100211022013 its reverse (31022011200102), we get a palindrome (51122222222115).
The spelling of 20100211022013 in words is "twenty trillion, one hundred billion, two hundred eleven million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •