Base | Representation |
---|---|
bin | 11110110000000000100… |
… | …010101110000001001110 |
3 | 21111000100212120021111102 |
4 | 132300000202232001032 |
5 | 234110144022323042 |
6 | 4254432050023102 |
7 | 305445256142315 |
oct | 36600042560116 |
9 | 7430325507442 |
10 | 2113133011022 |
11 | 7451a154a500 |
12 | 2a1657b77a92 |
13 | 124362b76947 |
14 | 743c1bc127c |
15 | 39e7a18eb32 |
hex | 1ec008ae04e |
2113133011022 has 12 divisors (see below), whose sum is σ = 3484049882208. Its totient is φ = 960515004900.
The previous prime is 2113133011021. The next prime is 2113133011027. The reversal of 2113133011022 is 2201103313112.
It is a happy number.
It is a super-2 number, since 2×21131330110222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2113133010985 and 2113133011003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2113133011021) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4365977054 + ... + 4365977537.
It is an arithmetic number, because the mean of its divisors is an integer number (290337490184).
Almost surely, 22113133011022 is an apocalyptic number.
2113133011022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2113133011022 is a deficient number, since it is larger than the sum of its proper divisors (1370916871186).
2113133011022 is a wasteful number, since it uses less digits than its factorization.
2113133011022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8731954615 (or 8731954604 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2113133011022 its reverse (2201103313112), we get a palindrome (4314236324134).
The spelling of 2113133011022 in words is "two trillion, one hundred thirteen billion, one hundred thirty-three million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •