Base | Representation |
---|---|
bin | 11011010010010000101010… |
… | …10011011101111101011111 |
3 | 21212110001012101011222210121 |
4 | 31221020111103131331133 |
5 | 30331024122420100421 |
6 | 331340034015215411 |
7 | 15431634652444636 |
oct | 1551102523357537 |
9 | 255401171158717 |
10 | 60001050550111 |
11 | 181333368a1a40 |
12 | 6890732517567 |
13 | 27630c8407288 |
14 | 10b60d008251d |
15 | 6e0b71e1bd41 |
hex | 3692154ddf5f |
60001050550111 has 8 divisors (see below), whose sum is σ = 67567165429248. Its totient is φ = 52786847991000.
The previous prime is 60001050550099. The next prime is 60001050550121. The reversal of 60001050550111 is 11105505010006.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 60001050550111 - 29 = 60001050549599 is a prime.
It is a super-2 number, since 2×600010505501112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60001050550121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 87978079645 + ... + 87978080326.
It is an arithmetic number, because the mean of its divisors is an integer number (8445895678656).
Almost surely, 260001050550111 is an apocalyptic number.
60001050550111 is a deficient number, since it is larger than the sum of its proper divisors (7566114879137).
60001050550111 is a wasteful number, since it uses less digits than its factorization.
60001050550111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175956160013.
The product of its (nonzero) digits is 750, while the sum is 25.
Adding to 60001050550111 its reverse (11105505010006), we get a palindrome (71106555560117).
The spelling of 60001050550111 in words is "sixty trillion, one billion, fifty million, five hundred fifty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •