Base | Representation |
---|---|
bin | 11110110000000000011… |
… | …011111001010000000111 |
3 | 21111000100202012101110012 |
4 | 132300000123321100013 |
5 | 234110143043101043 |
6 | 4254431543420435 |
7 | 305445235011503 |
oct | 36600033712007 |
9 | 7430322171405 |
10 | 2113131222023 |
11 | 7451a0538398 |
12 | 2a165745471b |
13 | 12436269b573 |
14 | 743c1877303 |
15 | 39e79e39a18 |
hex | 1ec006f9407 |
2113131222023 has 16 divisors (see below), whose sum is σ = 2222839708320. Its totient is φ = 2006889523200.
The previous prime is 2113131221977. The next prime is 2113131222031. The reversal of 2113131222023 is 3202221313112.
It is a cyclic number.
It is not a de Polignac number, because 2113131222023 - 214 = 2113131205639 is a prime.
It is a super-2 number, since 2×21131312220232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2113131222023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2113731222023) 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, 4112633 + ... + 4597826.
It is an arithmetic number, because the mean of its divisors is an integer number (138927481770).
Almost surely, 22113131222023 is an apocalyptic number.
2113131222023 is a deficient number, since it is larger than the sum of its proper divisors (109708486297).
2113131222023 is an equidigital number, since it uses as much as digits as its factorization.
2113131222023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8710658.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 2113131222023 its reverse (3202221313112), we get a palindrome (5315352535135).
The spelling of 2113131222023 in words is "two trillion, one hundred thirteen billion, one hundred thirty-one million, two hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •