Base | Representation |
---|---|
bin | 1000011001000111010111 |
3 | 11010202212100 |
4 | 20121013113 |
5 | 1030400043 |
6 | 115053143 |
7 | 24462030 |
oct | 10310727 |
9 | 4122770 |
10 | 2200023 |
11 | 1272a01 |
12 | 8a11b3 |
13 | 5c04b7 |
14 | 413a87 |
15 | 2d6cd3 |
hex | 2191d7 |
2200023 has 24 divisors (see below), whose sum is σ = 3714048. Its totient is φ = 1228752.
The previous prime is 2200013. The next prime is 2200031. The reversal of 2200023 is 3200022.
2200023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2200023 - 26 = 2199959 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2199978 and 2200014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200013) 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 23 ways as a sum of consecutive naturals, for example, 2590 + ... + 3332.
It is an arithmetic number, because the mean of its divisors is an integer number (154752).
22200023 is an apocalyptic number.
2200023 is a deficient number, since it is larger than the sum of its proper divisors (1514025).
2200023 is a wasteful number, since it uses less digits than its factorization.
2200023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 803 (or 800 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 9.
The square root of 2200023 is about 1483.2474506973. The cubic root of 2200023 is about 130.0595979200.
Adding to 2200023 its reverse (3200022), we get a palindrome (5400045).
Subtracting 2200023 from its reverse (3200022), we obtain a palindrome (999999).
The spelling of 2200023 in words is "two million, two hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •