Base | Representation |
---|---|
bin | 11110110110100000100… |
… | …010101000101011111001 |
3 | 21111200101021100110020102 |
4 | 132312200202220223321 |
5 | 234213442222423113 |
6 | 4301544404405145 |
7 | 306113234205623 |
oct | 36664042505371 |
9 | 7450337313212 |
10 | 2120112311033 |
11 | 748153145942 |
12 | 2a2a853a67b5 |
13 | 124c05ab2972 |
14 | 74884aadc13 |
15 | 3a237c6a758 |
hex | 1eda08a8af9 |
2120112311033 has 16 divisors (see below), whose sum is σ = 2150554513536. Its totient is φ = 2089918571520.
The previous prime is 2120112311029. The next prime is 2120112311069. The reversal of 2120112311033 is 3301132110212.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2120112311033 - 22 = 2120112311029 is a prime.
It is a super-2 number, since 2×21201123110332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2120112310996 and 2120112311014.
It is not an unprimeable number, because it can be changed into a prime (2120112301033) 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, 17054660 + ... + 17178522.
It is an arithmetic number, because the mean of its divisors is an integer number (134409657096).
Almost surely, 22120112311033 is an apocalyptic number.
It is an amenable number.
2120112311033 is a deficient number, since it is larger than the sum of its proper divisors (30442202503).
2120112311033 is a wasteful number, since it uses less digits than its factorization.
2120112311033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124864.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2120112311033 its reverse (3301132110212), we get a palindrome (5421244421245).
The spelling of 2120112311033 in words is "two trillion, one hundred twenty billion, one hundred twelve million, three hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •