Base | Representation |
---|---|
bin | 11110110000000101001… |
… | …100010101110111101111 |
3 | 21111000120022101002211002 |
4 | 132300011030111313233 |
5 | 234110324010443043 |
6 | 4254443514150515 |
7 | 305450224251011 |
oct | 36600514256757 |
9 | 7430508332732 |
10 | 2113211031023 |
11 | 745231599044 |
12 | 2a167a12243b |
13 | 124376092a21 |
14 | 743cc2d01b1 |
15 | 39e81e51bb8 |
hex | 1ec05315def |
2113211031023 has 16 divisors (see below), whose sum is σ = 2123139119616. Its totient is φ = 2103311808000.
The previous prime is 2113211030969. The next prime is 2113211031037. The reversal of 2113211031023 is 3201301123112.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2113211031023 - 226 = 2113143922159 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2113211030986 and 2113211031004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2113211031083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 650017148 + ... + 650020398.
It is an arithmetic number, because the mean of its divisors is an integer number (132696194976).
Almost surely, 22113211031023 is an apocalyptic number.
2113211031023 is a deficient number, since it is larger than the sum of its proper divisors (9928088593).
2113211031023 is a wasteful number, since it uses less digits than its factorization.
2113211031023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6814.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2113211031023 its reverse (3201301123112), we get a palindrome (5314512154135).
The spelling of 2113211031023 in words is "two trillion, one hundred thirteen billion, two hundred eleven million, thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •