Base | Representation |
---|---|
bin | 1000001100100001… |
… | …1000000100001111 |
3 | 12200022201010202202 |
4 | 2003020120010033 |
5 | 14001200323043 |
6 | 1002145512115 |
7 | 105342533210 |
oct | 20310300417 |
9 | 5608633682 |
10 | 2200011023 |
11 | a29937931 |
12 | 51494263b |
13 | 290a36692 |
14 | 16c281407 |
15 | cd2201b8 |
hex | 8321810f |
2200011023 has 4 divisors (see below), whose sum is σ = 2514298320. Its totient is φ = 1885723728.
The previous prime is 2200010993. The next prime is 2200011067. The reversal of 2200011023 is 3201100022.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2200011023 - 28 = 2200010767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2200010995 and 2200011013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200011223) 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 3 ways as a sum of consecutive naturals, for example, 157143638 + ... + 157143651.
It is an arithmetic number, because the mean of its divisors is an integer number (628574580).
Almost surely, 22200011023 is an apocalyptic number.
2200011023 is a deficient number, since it is larger than the sum of its proper divisors (314287297).
2200011023 is an equidigital number, since it uses as much as digits as its factorization.
2200011023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314287296.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 2200011023 is about 46904.2751036619. The cubic root of 2200011023 is about 1300.5936190325.
Adding to 2200011023 its reverse (3201100022), we get a palindrome (5401111045).
The spelling of 2200011023 in words is "two billion, two hundred million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •