Base | Representation |
---|---|
bin | 1001001011111001100111… |
… | …10010101010001100010001 |
3 | 2122112002222201010100210110 |
4 | 10211330303302222030101 |
5 | 10121424301112023441 |
6 | 110543444201551533 |
7 | 4153260211633020 |
oct | 445746362521421 |
9 | 78462881110713 |
10 | 20200100111121 |
11 | 64888a59961a7 |
12 | 2322ab87a55a9 |
13 | b36b27285158 |
14 | 4db99375c8b7 |
15 | 2506b6ed2b16 |
hex | 125f33caa311 |
20200100111121 has 32 divisors (see below), whose sum is σ = 31085316587520. Its totient is φ = 11428873677504.
The previous prime is 20200100111111. The next prime is 20200100111123. The reversal of 20200100111121 is 12111100100202.
It is not a de Polignac number, because 20200100111121 - 26 = 20200100111057 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20200100111097 and 20200100111106.
It is not an unprimeable number, because it can be changed into a prime (20200100111123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11770240 + ... + 13376798.
It is an arithmetic number, because the mean of its divisors is an integer number (971416143360).
Almost surely, 220200100111121 is an apocalyptic number.
20200100111121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20200100111121 is a deficient number, since it is larger than the sum of its proper divisors (10885216476399).
20200100111121 is a wasteful number, since it uses less digits than its factorization.
20200100111121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1612485.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20200100111121 its reverse (12111100100202), we get a palindrome (32311200211323).
The spelling of 20200100111121 in words is "twenty trillion, two hundred billion, one hundred million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •