Base | Representation |
---|---|
bin | 11011010011101100111000… |
… | …00000001001100001100001 |
3 | 21212121202222102122011011111 |
4 | 31221312130000021201201 |
5 | 30332332014043100311 |
6 | 331414502200343321 |
7 | 15435336506655121 |
oct | 1551663400114141 |
9 | 255552872564144 |
10 | 60050555050081 |
11 | 1815232a8a1532 |
12 | 689a249474b41 |
13 | 27679876091cb |
14 | 10b8668a6cc81 |
15 | 6e20bd036d21 |
hex | 369d9c009861 |
60050555050081 has 2 divisors, whose sum is σ = 60050555050082. Its totient is φ = 60050555050080.
The previous prime is 60050555049973. The next prime is 60050555050139. The reversal of 60050555050081 is 18005055505006.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60036152890000 + 14402160081 = 7748300^2 + 120009^2 .
It is a cyclic number.
It is not a de Polignac number, because 60050555050081 - 217 = 60050554919009 is a prime.
It is a super-2 number, since 2×600505550500812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (60050555050181) 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 as a sum of consecutive naturals, namely, 30025277525040 + 30025277525041.
It is an arithmetic number, because the mean of its divisors is an integer number (30025277525041).
Almost surely, 260050555050081 is an apocalyptic number.
It is an amenable number.
60050555050081 is a deficient number, since it is larger than the sum of its proper divisors (1).
60050555050081 is an equidigital number, since it uses as much as digits as its factorization.
60050555050081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150000, while the sum is 40.
The spelling of 60050555050081 in words is "sixty trillion, fifty billion, five hundred fifty-five million, fifty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •