Base | Representation |
---|---|
bin | 11110110110100001000… |
… | …100001010011101000101 |
3 | 21111200101212212222120110 |
4 | 132312201010022131011 |
5 | 234214002000200401 |
6 | 4301545321023233 |
7 | 306113402003004 |
oct | 36664104123505 |
9 | 7450355788513 |
10 | 2120121100101 |
11 | 7481580a9234 |
12 | 2a2a88324b19 |
13 | 124c0786c2b4 |
14 | 74885d1ac3b |
15 | 3a2389049d6 |
hex | 1eda110a745 |
2120121100101 has 16 divisors (see below), whose sum is σ = 2903366592000. Its totient is φ = 1375148461248.
The previous prime is 2120121100081. The next prime is 2120121100169. The reversal of 2120121100101 is 1010011210212.
It is not a de Polignac number, because 2120121100101 - 215 = 2120121067333 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 (2120121100301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1955335 + ... + 2839643.
It is an arithmetic number, because the mean of its divisors is an integer number (181460412000).
Almost surely, 22120121100101 is an apocalyptic number.
It is an amenable number.
2120121100101 is a deficient number, since it is larger than the sum of its proper divisors (783245491899).
2120121100101 is a wasteful number, since it uses less digits than its factorization.
2120121100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 905948.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2120121100101 its reverse (1010011210212), we get a palindrome (3130132310313).
It can be divided in two parts, 2120121 and 100101, that added together give a palindrome (2220222).
The spelling of 2120121100101 in words is "two trillion, one hundred twenty billion, one hundred twenty-one million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •