Base | Representation |
---|---|
bin | 1000001100100011… |
… | …0110000111010111 |
3 | 12200022221101121021 |
4 | 2003020312013113 |
5 | 14001213242403 |
6 | 1002152302011 |
7 | 105343555066 |
oct | 20310660727 |
9 | 5608841537 |
10 | 2200134103 |
11 | a29a11352 |
12 | 5149a1907 |
13 | 290a7a6cb |
14 | 16c2b41dd |
15 | cd2468bd |
hex | 832361d7 |
2200134103 has 4 divisors (see below), whose sum is σ = 2200238640. Its totient is φ = 2200029568.
The previous prime is 2200134091. The next prime is 2200134119. The reversal of 2200134103 is 3014310022.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2200134103 - 229 = 1663263191 is a prime.
It is a super-2 number, since 2×22001341032 = 9681180142367229218, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200134143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8458 + ... + 66871.
It is an arithmetic number, because the mean of its divisors is an integer number (550059660).
Almost surely, 22200134103 is an apocalyptic number.
2200134103 is a deficient number, since it is larger than the sum of its proper divisors (104537).
2200134103 is an equidigital number, since it uses as much as digits as its factorization.
2200134103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104536.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 2200134103 is about 46905.5871192335. The cubic root of 2200134103 is about 1300.6178725591.
Adding to 2200134103 its reverse (3014310022), we get a palindrome (5214444125).
The spelling of 2200134103 in words is "two billion, two hundred million, one hundred thirty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •