Base | Representation |
---|---|
bin | 100000001101010100001… |
… | …110000100010011010111 |
3 | 21211120222011012010010222 |
4 | 200031110032010103113 |
5 | 242230340202144343 |
6 | 4412441413104555 |
7 | 315623106126236 |
oct | 40152416042327 |
9 | 7746864163128 |
10 | 2213321131223 |
11 | 783734094044 |
12 | 2b8b5892815b |
13 | 13093b6412c7 |
14 | 791a7c10b1d |
15 | 3c890b88a68 |
hex | 203543844d7 |
2213321131223 has 16 divisors (see below), whose sum is σ = 2252180622720. Its totient is φ = 2174705335296.
The previous prime is 2213321131181. The next prime is 2213321131243. The reversal of 2213321131223 is 3221311233122.
It is a cyclic number.
It is not a de Polignac number, because 2213321131223 - 234 = 2196141262039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2213321131192 and 2213321131201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2213321131243) 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 15 ways as a sum of consecutive naturals, for example, 25059083 + ... + 25147251.
It is an arithmetic number, because the mean of its divisors is an integer number (140761288920).
Almost surely, 22213321131223 is an apocalyptic number.
2213321131223 is a deficient number, since it is larger than the sum of its proper divisors (38859491497).
2213321131223 is an equidigital number, since it uses as much as digits as its factorization.
2213321131223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89546.
The product of its digits is 2592, while the sum is 26.
Adding to 2213321131223 its reverse (3221311233122), we get a palindrome (5434632364345).
The spelling of 2213321131223 in words is "two trillion, two hundred thirteen billion, three hundred twenty-one million, one hundred thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •