Base | Representation |
---|---|
bin | 1000001101000000… |
… | …0010100010110111 |
3 | 12200110111012121011 |
4 | 2003100002202313 |
5 | 14002204120043 |
6 | 1002300533051 |
7 | 105365601310 |
oct | 20320024267 |
9 | 5613435534 |
10 | 2202020023 |
11 | a2aa8a265 |
12 | 515551187 |
13 | 29128ac38 |
14 | 16c645607 |
15 | cd4ba59d |
hex | 834028b7 |
2202020023 has 8 divisors (see below), whose sum is σ = 2626011648. Its totient is φ = 1805382744.
The previous prime is 2202020017. The next prime is 2202020027. The reversal of 2202020023 is 3200202022.
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 2202020023 - 29 = 2202019511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2202019985 and 2202020012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2202020027) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6838411 + ... + 6838732.
It is an arithmetic number, because the mean of its divisors is an integer number (328251456).
Almost surely, 22202020023 is an apocalyptic number.
2202020023 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2202020023 is a deficient number, since it is larger than the sum of its proper divisors (423991625).
2202020023 is a wasteful number, since it uses less digits than its factorization.
2202020023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13677173.
The product of its (nonzero) digits is 96, while the sum is 13.
The square root of 2202020023 is about 46925.6861750577. The cubic root of 2202020023 is about 1300.9893894191.
Adding to 2202020023 its reverse (3200202022), we get a palindrome (5402222045).
The spelling of 2202020023 in words is "two billion, two hundred two million, twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •