Base | Representation |
---|---|
bin | 11010001001111100000110… |
… | …11011101001000011110111 |
3 | 21112122111010202010120011201 |
4 | 31010332003123221003313 |
5 | 30014320444200401403 |
6 | 322154312004513331 |
7 | 15054254606351635 |
oct | 1504760333510367 |
9 | 245574122116151 |
10 | 57516112122103 |
11 | 1736549a93a718 |
12 | 654b0116ab847 |
13 | 261299124b81b |
14 | 102bb1a860355 |
15 | 69b1d573421d |
hex | 344f836e90f7 |
57516112122103 has 4 divisors (see below), whose sum is σ = 59499426333240. Its totient is φ = 55532797910968.
The previous prime is 57516112122101. The next prime is 57516112122137. The reversal of 57516112122103 is 30122121161575.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 57516112122103 - 21 = 57516112122101 is a prime.
It is a super-2 number, since 2×575161121221032 (a number of 28 digits) 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 (57516112122101) 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, 991657105525 + ... + 991657105582.
It is an arithmetic number, because the mean of its divisors is an integer number (14874856583310).
Almost surely, 257516112122103 is an apocalyptic number.
57516112122103 is a deficient number, since it is larger than the sum of its proper divisors (1983314211137).
57516112122103 is a wasteful number, since it uses less digits than its factorization.
57516112122103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1983314211136.
The product of its (nonzero) digits is 25200, while the sum is 37.
Adding to 57516112122103 its reverse (30122121161575), we get a palindrome (87638233283678).
The spelling of 57516112122103 in words is "fifty-seven trillion, five hundred sixteen billion, one hundred twelve million, one hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •