Base | Representation |
---|---|
bin | 111000101100110110… |
… | …100101111111110101 |
3 | 12211010222022122100001 |
4 | 320230312211333311 |
5 | 1444141301113221 |
6 | 43545133351301 |
7 | 4253466616066 |
oct | 705466457765 |
9 | 184128278301 |
10 | 60882051061 |
11 | 23902370087 |
12 | b971338531 |
13 | 598340abb0 |
14 | 2d37a9a56d |
15 | 18b4dd6391 |
hex | e2cda5ff5 |
60882051061 has 32 divisors (see below), whose sum is σ = 68075707392. Its totient is φ = 54069396480.
The previous prime is 60882051053. The next prime is 60882051107. The reversal of 60882051061 is 16015028806.
It is not a de Polignac number, because 60882051061 - 23 = 60882051053 is a prime.
It is a super-2 number, since 2×608820510612 (a number of 22 digits) contains 22 as substring.
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 60882051061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60882051161) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 89138826 + ... + 89139508.
It is an arithmetic number, because the mean of its divisors is an integer number (2127365856).
Almost surely, 260882051061 is an apocalyptic number.
It is an amenable number.
60882051061 is a deficient number, since it is larger than the sum of its proper divisors (7193656331).
60882051061 is a wasteful number, since it uses less digits than its factorization.
60882051061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1693.
The product of its (nonzero) digits is 23040, while the sum is 37.
Adding to 60882051061 its reverse (16015028806), we get a palindrome (76897079867).
The spelling of 60882051061 in words is "sixty billion, eight hundred eighty-two million, fifty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •