Base | Representation |
---|---|
bin | 11011100010011001100110… |
… | …11000110110110000010011 |
3 | 21221102001121022012202111100 |
4 | 31301030303120312300103 |
5 | 30414120340122410201 |
6 | 332442510020315443 |
7 | 15516666240504204 |
oct | 1561146330666023 |
9 | 257361538182440 |
10 | 60555606060051 |
11 | 18327540a37533 |
12 | 69600b9b42b83 |
13 | 27a34a503587b |
14 | 10d4c9aa315ab |
15 | 7002cc2ea886 |
hex | 371333636c13 |
60555606060051 has 12 divisors (see below), whose sum is σ = 89833241422912. Its totient is φ = 39279312038736.
The previous prime is 60555606060031. The next prime is 60555606060097. The reversal of 60555606060051 is 15006060655506.
60555606060051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 60555606060051 - 26 = 60555606059987 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 60555606059979 and 60555606060006.
It is not an unprimeable number, because it can be changed into a prime (60555606060031) 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 in 11 ways as a sum of consecutive naturals, for example, 90924333091 + ... + 90924333756.
Almost surely, 260555606060051 is an apocalyptic number.
60555606060051 is a deficient number, since it is larger than the sum of its proper divisors (29277635362861).
60555606060051 is a wasteful number, since it uses less digits than its factorization.
60555606060051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181848666890 (or 181848666887 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 45.
The spelling of 60555606060051 in words is "sixty trillion, five hundred fifty-five billion, six hundred six million, sixty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •