Base | Representation |
---|---|
bin | 1001001001000001011001… |
… | …11001011111000010011001 |
3 | 2122011122201012111221102020 |
4 | 10210200230321133002121 |
5 | 10113314224223241441 |
6 | 110430210333525053 |
7 | 4143156323441040 |
oct | 444405471370231 |
9 | 78148635457366 |
10 | 20101200212121 |
11 | 644a964534286 |
12 | 23078b7343789 |
13 | b2a6c5660362 |
14 | 4d6c90865557 |
15 | 24cd2964de66 |
hex | 12482ce5f099 |
20101200212121 has 16 divisors (see below), whose sum is σ = 30630715960704. Its totient is φ = 11486281757184.
The previous prime is 20101200212089. The next prime is 20101200212123. The reversal of 20101200212121 is 12121200210102.
It is not a de Polignac number, because 20101200212121 - 25 = 20101200212089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20101200212121.
It is not an unprimeable number, because it can be changed into a prime (20101200212123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2824470 + ... + 6941183.
It is an arithmetic number, because the mean of its divisors is an integer number (1914419747544).
Almost surely, 220101200212121 is an apocalyptic number.
20101200212121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20101200212121 is a deficient number, since it is larger than the sum of its proper divisors (10529515748583).
20101200212121 is an equidigital number, since it uses as much as digits as its factorization.
20101200212121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9863680.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20101200212121 its reverse (12121200210102), we get a palindrome (32222400422223).
The spelling of 20101200212121 in words is "twenty trillion, one hundred one billion, two hundred million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •