Base | Representation |
---|---|
bin | 100000010011101111011… |
… | …011100110000001111111 |
3 | 21212020202221211201000102 |
4 | 200103233123212001333 |
5 | 242334002322104043 |
6 | 4415542142151315 |
7 | 316256060402633 |
oct | 40235733460177 |
9 | 7766687751012 |
10 | 2220220113023 |
11 | 7866544111a0 |
12 | 2ba36328253b |
13 | 13149aa38163 |
14 | 79660192dc3 |
15 | 3cb4669b6b8 |
hex | 204ef6e607f |
2220220113023 has 64 divisors (see below), whose sum is σ = 2662767654912. Its totient is φ = 1828385095680.
The previous prime is 2220220113019. The next prime is 2220220113061. The reversal of 2220220113023 is 3203110220222.
It is a happy number.
It is not a de Polignac number, because 2220220113023 - 22 = 2220220113019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2220220112986 and 2220220113004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2220220113323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 226478840 + ... + 226488642.
It is an arithmetic number, because the mean of its divisors is an integer number (41605744608).
Almost surely, 22220220113023 is an apocalyptic number.
2220220113023 is a deficient number, since it is larger than the sum of its proper divisors (442547541889).
2220220113023 is a wasteful number, since it uses less digits than its factorization.
2220220113023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10304.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 2220220113023 its reverse (3203110220222), we get a palindrome (5423330333245).
The spelling of 2220220113023 in words is "two trillion, two hundred twenty billion, two hundred twenty million, one hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •