Base | Representation |
---|---|
bin | 1001001001000010111011… |
… | …10001011111011010100101 |
3 | 2122011201211100110122110102 |
4 | 10210201131301133122211 |
5 | 10113322414132400401 |
6 | 110430423545033445 |
7 | 4143215541303410 |
oct | 444413561373245 |
9 | 78151740418412 |
10 | 20102020200101 |
11 | 64502453873a4 |
12 | 2307aa5a85885 |
13 | b2a7c64c1048 |
14 | 4d6d2b714b77 |
15 | 24cd7662356b |
hex | 12485dc5f6a5 |
20102020200101 has 32 divisors (see below), whose sum is σ = 23259907507200. Its totient is φ = 17017273276416.
The previous prime is 20102020200091. The next prime is 20102020200167. The reversal of 20102020200101 is 10100202020102.
It is a happy number.
It is not a de Polignac number, because 20102020200101 - 214 = 20102020183717 is a prime.
It is a super-2 number, since 2×201020202001012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20102020200181) 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, 128919281 + ... + 129075113.
It is an arithmetic number, because the mean of its divisors is an integer number (726872109600).
Almost surely, 220102020200101 is an apocalyptic number.
It is an amenable number.
20102020200101 is a deficient number, since it is larger than the sum of its proper divisors (3157887307099).
20102020200101 is a wasteful number, since it uses less digits than its factorization.
20102020200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156693.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 20102020200101 its reverse (10100202020102), we get a palindrome (30202222220203).
The spelling of 20102020200101 in words is "twenty trillion, one hundred two billion, twenty million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •