Base | Representation |
---|---|
bin | 11110100011111000111… |
… | …110010010110101100101 |
3 | 21102202210001101201202110 |
4 | 132203320332102311211 |
5 | 233402022001320401 |
6 | 4244440552031233 |
7 | 304504646661264 |
oct | 36437076226545 |
9 | 7382701351673 |
10 | 2100121120101 |
11 | 73a724693244 |
12 | 29b026392519 |
13 | 12306b1a07c4 |
14 | 73909a3c5db |
15 | 39967b8e9d6 |
hex | 1e8f8f92d65 |
2100121120101 has 32 divisors (see below), whose sum is σ = 2879709297408. Its totient is φ = 1360409955840.
The previous prime is 2100121120099. The next prime is 2100121120103. The reversal of 2100121120101 is 1010211210012.
It is an interprime number because it is at equal distance from previous prime (2100121120099) and next prime (2100121120103).
It is not a de Polignac number, because 2100121120101 - 21 = 2100121120099 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2100121120103) 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, 464934895 + ... + 464939411.
It is an arithmetic number, because the mean of its divisors is an integer number (89990915544).
Almost surely, 22100121120101 is an apocalyptic number.
It is an amenable number.
2100121120101 is a deficient number, since it is larger than the sum of its proper divisors (779588177307).
2100121120101 is a wasteful number, since it uses less digits than its factorization.
2100121120101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9261.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2100121120101 its reverse (1010211210012), we get a palindrome (3110332330113).
It can be divided in two parts, 2100121 and 120101, that added together give a palindrome (2220222).
The spelling of 2100121120101 in words is "two trillion, one hundred billion, one hundred twenty-one million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •