Base | Representation |
---|---|
bin | 100000010110100111101… |
… | …111000000110010110010 |
3 | 21212112202110011120012020 |
4 | 200112213233000302302 |
5 | 242411320411223442 |
6 | 4421213040412310 |
7 | 316425514660122 |
oct | 40264757006262 |
9 | 7775673146166 |
10 | 2223312211122 |
11 | 7879a0866272 |
12 | 2baa86917096 |
13 | 1318715275c2 |
14 | 79874ad0c82 |
15 | 3cc77d839ec |
hex | 205a7bc0cb2 |
2223312211122 has 16 divisors (see below), whose sum is σ = 4446640461792. Its totient is φ = 741101397120.
The previous prime is 2223312211117. The next prime is 2223312211129. The reversal of 2223312211122 is 2211122133222.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 2223312211092 and 2223312211101.
It is not an unprimeable number, because it can be changed into a prime (2223312211129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1882722 + ... + 2826882.
It is an arithmetic number, because the mean of its divisors is an integer number (277915028862).
Almost surely, 22223312211122 is an apocalyptic number.
2223312211122 is an abundant number, since it is smaller than the sum of its proper divisors (2223328250670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2223312211122 is a wasteful number, since it uses less digits than its factorization.
2223312211122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1336633.
The product of its digits is 1152, while the sum is 24.
Adding to 2223312211122 its reverse (2211122133222), we get a palindrome (4434434344344).
The spelling of 2223312211122 in words is "two trillion, two hundred twenty-three billion, three hundred twelve million, two hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •