Base | Representation |
---|---|
bin | 111000011001011010… |
… | …110011101100101001 |
3 | 12210022020210112102100 |
4 | 320121122303230221 |
5 | 1443004314000131 |
6 | 43452525124013 |
7 | 4242430336035 |
oct | 703132635451 |
9 | 183266715370 |
10 | 60556000041 |
11 | 23755313129 |
12 | b8a00b9609 |
13 | 59309bb6b4 |
14 | 2d066651c5 |
15 | 189647d7e6 |
hex | e196b3b29 |
60556000041 has 24 divisors (see below), whose sum is σ = 91284126336. Its totient is φ = 38610633600.
The previous prime is 60556000007. The next prime is 60556000049. The reversal of 60556000041 is 14000065506.
It is a happy number.
60556000041 is a `hidden beast` number, since 6 + 0 + 55 + 600 + 0 + 0 + 4 + 1 = 666.
It is not a de Polignac number, because 60556000041 - 27 = 60555999913 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 60555999969 and 60556000014.
It is not an unprimeable number, because it can be changed into a prime (60556000049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2495316 + ... + 2519466.
It is an arithmetic number, because the mean of its divisors is an integer number (3803505264).
Almost surely, 260556000041 is an apocalyptic number.
It is an amenable number.
60556000041 is a deficient number, since it is larger than the sum of its proper divisors (30728126295).
60556000041 is a wasteful number, since it uses less digits than its factorization.
60556000041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36293 (or 36290 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 60556000041 its reverse (14000065506), we get a palindrome (74556065547).
The spelling of 60556000041 in words is "sixty billion, five hundred fifty-six million, forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •