Base | Representation |
---|---|
bin | 110111111110111010… |
… | …010011100010110001 |
3 | 12202011020222000101121 |
4 | 313332322103202301 |
5 | 1441101441201423 |
6 | 43340441102241 |
7 | 4225420245124 |
oct | 677672234261 |
9 | 182136860347 |
10 | 60111272113 |
11 | 23547278492 |
12 | b797187981 |
13 | 588c819589 |
14 | 2ca357a3bb |
15 | 186c3d245d |
hex | dfee938b1 |
60111272113 has 4 divisors (see below), whose sum is σ = 60111837808. Its totient is φ = 60110706420.
The previous prime is 60111272101. The next prime is 60111272119. The reversal of 60111272113 is 31127211106.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-60111272113 is a prime.
It is a super-2 number, since 2×601112721132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (60111272119) 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, 70131 + ... + 353752.
It is an arithmetic number, because the mean of its divisors is an integer number (15027959452).
Almost surely, 260111272113 is an apocalyptic number.
It is an amenable number.
60111272113 is a deficient number, since it is larger than the sum of its proper divisors (565695).
60111272113 is a wasteful number, since it uses less digits than its factorization.
60111272113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 565694.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 60111272113 its reverse (31127211106), we get a palindrome (91238483219).
The spelling of 60111272113 in words is "sixty billion, one hundred eleven million, two hundred seventy-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •