Base | Representation |
---|---|
bin | 11011011110101001101001… |
… | …00001100110100100010000 |
3 | 21220221202001220221021112210 |
4 | 31233110310201212210100 |
5 | 30410013014141031001 |
6 | 332303402215352120 |
7 | 15504455562142203 |
oct | 1557246441464420 |
9 | 256852056837483 |
10 | 60426776111376 |
11 | 18287940879274 |
12 | 693b145082640 |
13 | 27942b369a9cc |
14 | 10cc958adb93a |
15 | 6ebc8c058dd6 |
hex | 36f534866910 |
60426776111376 has 160 divisors (see below), whose sum is σ = 158760354242560. Its totient is φ = 19801619914752.
The previous prime is 60426776111363. The next prime is 60426776111447. The reversal of 60426776111376 is 67311167762406.
It is a super-2 number, since 2×604267761113762 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1424030256 + ... + 1424072688.
It is an arithmetic number, because the mean of its divisors is an integer number (992252214016).
Almost surely, 260426776111376 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 60426776111376, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79380177121280).
60426776111376 is an abundant number, since it is smaller than the sum of its proper divisors (98333578131184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60426776111376 is a wasteful number, since it uses less digits than its factorization.
60426776111376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44133 (or 44127 counting only the distinct ones).
The product of its (nonzero) digits is 10668672, while the sum is 57.
The spelling of 60426776111376 in words is "sixty trillion, four hundred twenty-six billion, seven hundred seventy-six million, one hundred eleven thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •