Base | Representation |
---|---|
bin | 11011011001101010011011… |
… | …10000000101000111001011 |
3 | 21220100100201110202120100212 |
4 | 31230311031300011013023 |
5 | 30344211030031120232 |
6 | 332052540544351335 |
7 | 15456210666542165 |
oct | 1554651560050713 |
9 | 256310643676325 |
10 | 60255400645067 |
11 | 18221198899991 |
12 | 6911a9791554b |
13 | 27810a17a5044 |
14 | 10c453c4db935 |
15 | 6e75abab2eb2 |
hex | 36cd4dc051cb |
60255400645067 has 2 divisors, whose sum is σ = 60255400645068. Its totient is φ = 60255400645066.
The previous prime is 60255400645057. The next prime is 60255400645079. The reversal of 60255400645067 is 76054600455206.
60255400645067 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 60255400645067 - 212 = 60255400640971 is a prime.
It is a super-2 number, since 2×602554006450672 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (60255400645057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30127700322533 + 30127700322534.
It is an arithmetic number, because the mean of its divisors is an integer number (30127700322534).
Almost surely, 260255400645067 is an apocalyptic number.
60255400645067 is a deficient number, since it is larger than the sum of its proper divisors (1).
60255400645067 is an equidigital number, since it uses as much as digits as its factorization.
60255400645067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048000, while the sum is 50.
The spelling of 60255400645067 in words is "sixty trillion, two hundred fifty-five billion, four hundred million, six hundred forty-five thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •