Base | Representation |
---|---|
bin | 100000001101010100001… |
… | …101111111111000011001 |
3 | 21211120222011011012022020 |
4 | 200031110031333320121 |
5 | 242230340201104423 |
6 | 4412441412445053 |
7 | 315623106022365 |
oct | 40152415777031 |
9 | 7746864135266 |
10 | 2213321113113 |
11 | 783734081480 |
12 | 2b8b58919789 |
13 | 13093b635ca6 |
14 | 791a7c082a5 |
15 | 3c890b834e3 |
hex | 2035437fe19 |
2213321113113 has 32 divisors (see below), whose sum is σ = 3251257712640. Its totient is φ = 1328185282560.
The previous prime is 2213321113109. The next prime is 2213321113117. The reversal of 2213321113113 is 3113111233122.
2213321113113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (2213321113109) and next prime (2213321113117).
It is not a de Polignac number, because 2213321113113 - 22 = 2213321113109 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2213321113117) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 634968 + ... + 2197686.
It is an arithmetic number, because the mean of its divisors is an integer number (101601803520).
Almost surely, 22213321113113 is an apocalyptic number.
It is an amenable number.
2213321113113 is a deficient number, since it is larger than the sum of its proper divisors (1037936599527).
2213321113113 is a wasteful number, since it uses less digits than its factorization.
2213321113113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1563157.
The product of its digits is 648, while the sum is 24.
Adding to 2213321113113 its reverse (3113111233122), we get a palindrome (5326432346235).
The spelling of 2213321113113 in words is "two trillion, two hundred thirteen billion, three hundred twenty-one million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •