Base | Representation |
---|---|
bin | 1000001101001111… |
… | …0010000010110100 |
3 | 12200112100001021002 |
4 | 2003103302002310 |
5 | 14002432013022 |
6 | 1002333542432 |
7 | 105410125322 |
oct | 20323620264 |
9 | 5615301232 |
10 | 2203001012 |
11 | a3059a2a3 |
12 | 515944a18 |
13 | 2915425c4 |
14 | 16c81cd12 |
15 | cd611092 |
hex | 834f20b4 |
2203001012 has 12 divisors (see below), whose sum is σ = 3949282596. Its totient is φ = 1074634560.
The previous prime is 2203001011. The next prime is 2203001029. The reversal of 2203001012 is 2101003022.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 266472976 + 1936528036 = 16324^2 + 44006^2 .
It is a junction number, because it is equal to n+sod(n) for n = 2203000984 and 2203001002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2203001011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6716303 + ... + 6716630.
It is an arithmetic number, because the mean of its divisors is an integer number (329106883).
Almost surely, 22203001012 is an apocalyptic number.
It is an amenable number.
2203001012 is a deficient number, since it is larger than the sum of its proper divisors (1746281584).
2203001012 is a wasteful number, since it uses less digits than its factorization.
2203001012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13432978 (or 13432976 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 2203001012 is about 46936.1375914124. The cubic root of 2203001012 is about 1301.1825555108.
Adding to 2203001012 its reverse (2101003022), we get a palindrome (4304004034).
The spelling of 2203001012 in words is "two billion, two hundred three million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •