Base | Representation |
---|---|
bin | 11110100110100111100… |
… | …011100001001001011011 |
3 | 21110001100011211000112011 |
4 | 132212213203201021123 |
5 | 233424021312114002 |
6 | 4250043342330351 |
7 | 304640354006101 |
oct | 36464743411133 |
9 | 7401304730464 |
10 | 2103050113627 |
11 | 740997a65451 |
12 | 29b7032899b7 |
13 | 123416c53378 |
14 | 73b06a3dc71 |
15 | 39a89da98d7 |
hex | 1e9a78e125b |
2103050113627 has 8 divisors (see below), whose sum is σ = 2115977806656. Its totient is φ = 2090161537152.
The previous prime is 2103050113601. The next prime is 2103050113639. The reversal of 2103050113627 is 7263110503012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2103050113627 is a prime.
It is a super-3 number, since 3×21030501136273 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2103050113127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9671278 + ... + 9886339.
It is an arithmetic number, because the mean of its divisors is an integer number (264497225832).
Almost surely, 22103050113627 is an apocalyptic number.
2103050113627 is a deficient number, since it is larger than the sum of its proper divisors (12927693029).
2103050113627 is a wasteful number, since it uses less digits than its factorization.
2103050113627 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19558277.
The product of its (nonzero) digits is 7560, while the sum is 31.
Adding to 2103050113627 its reverse (7263110503012), we get a palindrome (9366160616639).
The spelling of 2103050113627 in words is "two trillion, one hundred three billion, fifty million, one hundred thirteen thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •