Base | Representation |
---|---|
bin | 11110110000000100100… |
… | …110100010111011010111 |
3 | 21111000112121201201121102 |
4 | 132300010212202323113 |
5 | 234110313441414111 |
6 | 4254442521540315 |
7 | 305450044113515 |
oct | 36600446427327 |
9 | 7430477651542 |
10 | 2113201123031 |
11 | 745226a41019 |
12 | 2a167694469b |
13 | 124374003ccb |
14 | 743cac714b5 |
15 | 39e8114613b |
hex | 1ec049a2ed7 |
2113201123031 has 16 divisors (see below), whose sum is σ = 2213661063168. Its totient is φ = 2013471583200.
The previous prime is 2113201123001. The next prime is 2113201123039. The reversal of 2113201123031 is 1303211023112.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2113201123031 - 210 = 2113201122007 is a prime.
It is a super-2 number, since 2×21132011230312 (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 = 2113201122994 and 2113201123012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2113201123039) 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, 5936570 + ... + 6282456.
It is an arithmetic number, because the mean of its divisors is an integer number (138353816448).
Almost surely, 22113201123031 is an apocalyptic number.
2113201123031 is a deficient number, since it is larger than the sum of its proper divisors (100459940137).
2113201123031 is a wasteful number, since it uses less digits than its factorization.
2113201123031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346942.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2113201123031 its reverse (1303211023112), we get a palindrome (3416412146143).
The spelling of 2113201123031 in words is "two trillion, one hundred thirteen billion, two hundred one million, one hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •