Base | Representation |
---|---|
bin | 11011010101111000011001… |
… | …10000100010001010011100 |
3 | 21212212221022202211011100111 |
4 | 31222330030300202022130 |
5 | 30340043421033214030 |
6 | 331513131111535404 |
7 | 15443630656652062 |
oct | 1552741460421234 |
9 | 255787282734314 |
10 | 60125461226140 |
11 | 18181079438262 |
12 | 68b087338a564 |
13 | 2771a64321acb |
14 | 10bc1330c2032 |
15 | 6e400421962a |
hex | 36af0cc2229c |
60125461226140 has 12 divisors (see below), whose sum is σ = 126263468574936. Its totient is φ = 24050184490448.
The previous prime is 60125461226107. The next prime is 60125461226143. The reversal of 60125461226140 is 4162216452106.
It is a junction number, because it is equal to n+sod(n) for n = 60125461226093 and 60125461226102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60125461226143) 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, 1503136530634 + ... + 1503136530673.
It is an arithmetic number, because the mean of its divisors is an integer number (10521955714578).
Almost surely, 260125461226140 is an apocalyptic number.
It is an amenable number.
60125461226140 is an abundant number, since it is smaller than the sum of its proper divisors (66138007348796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60125461226140 is a wasteful number, since it uses less digits than its factorization.
60125461226140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3006273061316 (or 3006273061314 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 40.
Adding to 60125461226140 its reverse (4162216452106), we get a palindrome (64287677678246).
The spelling of 60125461226140 in words is "sixty trillion, one hundred twenty-five billion, four hundred sixty-one million, two hundred twenty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •