Base | Representation |
---|---|
bin | 1000001100110011… |
… | …1011100100011111 |
3 | 12200101221210121222 |
4 | 2003030323210133 |
5 | 14002002030043 |
6 | 1002231243555 |
7 | 105355635233 |
oct | 20314734437 |
9 | 5611853558 |
10 | 2201205023 |
11 | a2a582a06 |
12 | 5152195bb |
13 | 291063ca4 |
14 | 16c4b25c3 |
15 | cd3a8d68 |
hex | 8333b91f |
2201205023 has 4 divisors (see below), whose sum is σ = 2201496480. Its totient is φ = 2200913568.
The previous prime is 2201205011. The next prime is 2201205029. The reversal of 2201205023 is 3205021022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2201205023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2201204992 and 2201205010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201205029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 134090 + ... + 149607.
It is an arithmetic number, because the mean of its divisors is an integer number (550374120).
Almost surely, 22201205023 is an apocalyptic number.
2201205023 is a deficient number, since it is larger than the sum of its proper divisors (291457).
2201205023 is an equidigital number, since it uses as much as digits as its factorization.
2201205023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291456.
The product of its (nonzero) digits is 240, while the sum is 17.
The square root of 2201205023 is about 46917.0014280538. The cubic root of 2201205023 is about 1300.8288645102.
Adding to 2201205023 its reverse (3205021022), we get a palindrome (5406226045).
The spelling of 2201205023 in words is "two billion, two hundred one million, two hundred five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •