Base | Representation |
---|---|
bin | 100000001101001000010… |
… | …110111100000001011011 |
3 | 21211120110021201210210201 |
4 | 200031020112330001123 |
5 | 242224433231130021 |
6 | 4412405543523031 |
7 | 315615141501622 |
oct | 40151026740133 |
9 | 7746407653721 |
10 | 2213122130011 |
11 | 783641823531 |
12 | 2b8b02159477 |
13 | 130909346800 |
14 | 7918960c6b9 |
15 | 3c87d47a591 |
hex | 203485bc05b |
2213122130011 has 48 divisors (see below), whose sum is σ = 2444168496000. Its totient is φ = 2002597758720.
The previous prime is 2213122129993. The next prime is 2213122130029. The reversal of 2213122130011 is 1100312213122.
It is an interprime number because it is at equal distance from previous prime (2213122129993) and next prime (2213122130029).
It is not a de Polignac number, because 2213122130011 - 25 = 2213122129979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2213122130711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1889941456 + ... + 1889942626.
It is an arithmetic number, because the mean of its divisors is an integer number (50920177000).
Almost surely, 22213122130011 is an apocalyptic number.
2213122130011 is a deficient number, since it is larger than the sum of its proper divisors (231046365989).
2213122130011 is a wasteful number, since it uses less digits than its factorization.
2213122130011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2076 (or 2063 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 2213122130011 its reverse (1100312213122), we get a palindrome (3313434343133).
The spelling of 2213122130011 in words is "two trillion, two hundred thirteen billion, one hundred twenty-two million, one hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •