Base | Representation |
---|---|
bin | 100000010110011011110… |
… | …000010011011011101101 |
3 | 21212112020102222022100111 |
4 | 200112123300103123231 |
5 | 242410412433114041 |
6 | 4421141100500021 |
7 | 316420524416023 |
oct | 40263360233355 |
9 | 7775212868314 |
10 | 2223111223021 |
11 | 7878a83689a7 |
12 | 2baa2b54a611 |
13 | 13183b9b5630 |
14 | 79856132713 |
15 | 3cc653d1981 |
hex | 2059bc136ed |
2223111223021 has 16 divisors (see below), whose sum is σ = 2559561548544. Its totient is φ = 1912639359744.
The previous prime is 2223111223001. The next prime is 2223111223027. The reversal of 2223111223021 is 1203221113222.
2223111223021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2223111223021 - 219 = 2223110698733 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2223111222983 and 2223111223001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2223111223027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48808921 + ... + 48854446.
It is an arithmetic number, because the mean of its divisors is an integer number (159972596784).
Almost surely, 22223111223021 is an apocalyptic number.
It is an amenable number.
2223111223021 is a deficient number, since it is larger than the sum of its proper divisors (336450325523).
2223111223021 is a wasteful number, since it uses less digits than its factorization.
2223111223021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97663500.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 2223111223021 its reverse (1203221113222), we get a palindrome (3426332336243).
The spelling of 2223111223021 in words is "two trillion, two hundred twenty-three billion, one hundred eleven million, two hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •