Base | Representation |
---|---|
bin | 1000010011101110… |
… | …0111010011110111 |
3 | 12202102112220201121 |
4 | 2010323213103313 |
5 | 14031414020043 |
6 | 1005145204411 |
7 | 106160362123 |
oct | 20473472367 |
9 | 5672486647 |
10 | 2230220023 |
11 | a449a0349 |
12 | 522a90707 |
13 | 297082825 |
14 | 1722a6583 |
15 | d0bdaded |
hex | 84ee74f7 |
2230220023 has 8 divisors (see below), whose sum is σ = 2257430000. Its totient is φ = 2203096320.
The previous prime is 2230219997. The next prime is 2230220053. The reversal of 2230220023 is 3200220322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2230220023 - 25 = 2230219991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2230219979 and 2230220006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2230220053) 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, 31228 + ... + 73726.
It is an arithmetic number, because the mean of its divisors is an integer number (282178750).
Almost surely, 22230220023 is an apocalyptic number.
2230220023 is a deficient number, since it is larger than the sum of its proper divisors (27209977).
2230220023 is an equidigital number, since it uses as much as digits as its factorization.
2230220023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43137.
The product of its (nonzero) digits is 288, while the sum is 16.
The square root of 2230220023 is about 47225.2053780606. The cubic root of 2230220023 is about 1306.5195226056.
Adding to 2230220023 its reverse (3200220322), we get a palindrome (5430440345).
The spelling of 2230220023 in words is "two billion, two hundred thirty million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •