Base | Representation |
---|---|
bin | 1000001101000000… |
… | …0011010001100101 |
3 | 12200110111100200220 |
4 | 2003100003101211 |
5 | 14002204214023 |
6 | 1002300554553 |
7 | 105365613111 |
oct | 20320032145 |
9 | 5613440626 |
10 | 2202023013 |
11 | a2aa91533 |
12 | 515552a59 |
13 | 29128c3c8 |
14 | 16c646741 |
15 | cd4bb3e3 |
hex | 83403465 |
2202023013 has 16 divisors (see below), whose sum is σ = 3080628096. Its totient is φ = 1396422720.
The previous prime is 2202023003. The next prime is 2202023081. The reversal of 2202023013 is 3103202022.
It is not a de Polignac number, because 2202023013 - 25 = 2202022981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2202022983 and 2202023001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2202023003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 75670 + ... + 100647.
It is an arithmetic number, because the mean of its divisors is an integer number (192539256).
Almost surely, 22202023013 is an apocalyptic number.
2202023013 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2202023013 is a deficient number, since it is larger than the sum of its proper divisors (878605083).
2202023013 is a wasteful number, since it uses less digits than its factorization.
2202023013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176524.
The product of its (nonzero) digits is 144, while the sum is 15.
The square root of 2202023013 is about 46925.7180339310. The cubic root of 2202023013 is about 1300.9899782658.
Adding to 2202023013 its reverse (3103202022), we get a palindrome (5305225035).
The spelling of 2202023013 in words is "two billion, two hundred two million, twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •