Base | Representation |
---|---|
bin | 11110110110011001111… |
… | …110010010110110010111 |
3 | 21111200002121000020002012 |
4 | 132312121332102312113 |
5 | 234213231020333421 |
6 | 4301525430534435 |
7 | 306110425463330 |
oct | 36663176226627 |
9 | 7450077006065 |
10 | 2120002121111 |
11 | 7480a6a24596 |
12 | 2a2a5450741b |
13 | 124bb9012024 |
14 | 748741c9287 |
15 | 3a22d25195b |
hex | 1ed99f92d97 |
2120002121111 has 16 divisors (see below), whose sum is σ = 2447180344320. Its totient is φ = 1798908976800.
The previous prime is 2120002121099. The next prime is 2120002121117. The reversal of 2120002121111 is 1111212000212.
It is a cyclic number.
It is not a de Polignac number, because 2120002121111 - 26 = 2120002121047 is a prime.
It is a super-2 number, since 2×21200021211112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2120002121117) 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, 5107730 + ... + 5507168.
It is an arithmetic number, because the mean of its divisors is an integer number (152948771520).
Almost surely, 22120002121111 is an apocalyptic number.
2120002121111 is a deficient number, since it is larger than the sum of its proper divisors (327178223209).
2120002121111 is a wasteful number, since it uses less digits than its factorization.
2120002121111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 407054.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2120002121111 its reverse (1111212000212), we get a palindrome (3231214121323).
It can be divided in two parts, 212000212 and 1111, that multiplied together give a palindrome (235532235532).
The spelling of 2120002121111 in words is "two trillion, one hundred twenty billion, two million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •