Base | Representation |
---|---|
bin | 1000001101000010… |
… | …1110111111001111 |
3 | 12200110211110022101 |
4 | 2003100232333033 |
5 | 14002230431223 |
6 | 1002304455531 |
7 | 105400260115 |
oct | 20320567717 |
9 | 5613743271 |
10 | 2202202063 |
11 | a300a4006 |
12 | 51561a5a7 |
13 | 291322a59 |
14 | 16c691ab5 |
15 | cd5044ad |
hex | 8342efcf |
2202202063 has 8 divisors (see below), whose sum is σ = 2215371600. Its totient is φ = 2189064768.
The previous prime is 2202202039. The next prime is 2202202069. The reversal of 2202202063 is 3602022022.
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 2202202063 - 213 = 2202193871 is a prime.
It is a super-4 number, since 4×22022020634 (a number of 38 digits) contains 4444 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2202202063.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2202202069) 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, 136593 + ... + 151861.
It is an arithmetic number, because the mean of its divisors is an integer number (276921450).
Almost surely, 22202202063 is an apocalyptic number.
2202202063 is a deficient number, since it is larger than the sum of its proper divisors (13169537).
2202202063 is a wasteful number, since it uses less digits than its factorization.
2202202063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16121.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 2202202063 is about 46927.6257976045. The cubic root of 2202202063 is about 1301.0252391662.
Adding to 2202202063 its reverse (3602022022), we get a palindrome (5804224085).
The spelling of 2202202063 in words is "two billion, two hundred two million, two hundred two thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •