Base | Representation |
---|---|
bin | 110111111111000001… |
… | …111011100110100101 |
3 | 12202011101201120122001 |
4 | 313333001323212211 |
5 | 1441102444134310 |
6 | 43340552005301 |
7 | 4225443242311 |
oct | 677701734645 |
9 | 182141646561 |
10 | 60113271205 |
11 | 23548413429 |
12 | b797990831 |
13 | 5890069480 |
14 | 2ca393ab41 |
15 | 186c67993a |
hex | dff07b9a5 |
60113271205 has 16 divisors (see below), whose sum is σ = 77893144560. Its totient is φ = 44272309248.
The previous prime is 60113271199. The next prime is 60113271241. The reversal of 60113271205 is 50217231106.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 18671041 + 60094600164 = 4321^2 + 245142^2 .
It is a cyclic number.
It is not a de Polignac number, because 60113271205 - 219 = 60112746917 is a prime.
It is a super-2 number, since 2×601132712052 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1215460 + ... + 1263949.
It is an arithmetic number, because the mean of its divisors is an integer number (4868321535).
Almost surely, 260113271205 is an apocalyptic number.
60113271205 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
60113271205 is a deficient number, since it is larger than the sum of its proper divisors (17779873355).
60113271205 is a wasteful number, since it uses less digits than its factorization.
60113271205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2479800.
The product of its (nonzero) digits is 2520, while the sum is 28.
The spelling of 60113271205 in words is "sixty billion, one hundred thirteen million, two hundred seventy-one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •