Base | Representation |
---|---|
bin | 1010011101000001… |
… | …01101110000111011 |
3 | 112111010021120201112 |
4 | 11032200231300323 |
5 | 42443203304303 |
6 | 2324520110535 |
7 | 256034424410 |
oct | 51640556073 |
9 | 15433246645 |
10 | 5612166203 |
11 | 241aa15596 |
12 | 110760544b |
13 | 6b5927007 |
14 | 3b34d4107 |
15 | 22ca790d8 |
hex | 14e82dc3b |
5612166203 has 8 divisors (see below), whose sum is σ = 6415157472. Its totient is φ = 4809488256.
The previous prime is 5612166169. The next prime is 5612166289. The reversal of 5612166203 is 3026612165.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5612166203 - 26 = 5612166139 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5612166203.
It is not an unprimeable number, because it can be changed into a prime (5612166403) 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 7 ways as a sum of consecutive naturals, for example, 38600 + ... + 112757.
It is an arithmetic number, because the mean of its divisors is an integer number (801894684).
Almost surely, 25612166203 is an apocalyptic number.
5612166203 is a deficient number, since it is larger than the sum of its proper divisors (802991269).
5612166203 is a wasteful number, since it uses less digits than its factorization.
5612166203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156661.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 5612166203 is about 74914.3924957014. The cubic root of 5612166203 is about 1777.0930757322.
Adding to 5612166203 its reverse (3026612165), we get a palindrome (8638778368).
The spelling of 5612166203 in words is "five billion, six hundred twelve million, one hundred sixty-six thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •