Base | Representation |
---|---|
bin | 110111111110100100… |
… | …100000000001001101 |
3 | 12202010212012121102101 |
4 | 313332210200001031 |
5 | 1441044010243140 |
6 | 43340114355101 |
7 | 4225320540163 |
oct | 677644400115 |
9 | 182125177371 |
10 | 60105556045 |
11 | 23544023967 |
12 | b79528ba91 |
13 | 588b5978a2 |
14 | 2ca28cd233 |
15 | 186bb5399a |
hex | dfe92004d |
60105556045 has 4 divisors (see below), whose sum is σ = 72126667260. Its totient is φ = 48084444832.
The previous prime is 60105556039. The next prime is 60105556079. The reversal of 60105556045 is 54065550106.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14435301609 + 45670254436 = 120147^2 + 213706^2 .
It is a cyclic number.
It is not a de Polignac number, because 60105556045 - 211 = 60105553997 is a prime.
It is a super-2 number, since 2×601055560452 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 60105555995 and 60105556013.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6010555600 + ... + 6010555609.
It is an arithmetic number, because the mean of its divisors is an integer number (18031666815).
Almost surely, 260105556045 is an apocalyptic number.
It is an amenable number.
60105556045 is a deficient number, since it is larger than the sum of its proper divisors (12021111215).
60105556045 is a wasteful number, since it uses less digits than its factorization.
60105556045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12021111214.
The product of its (nonzero) digits is 90000, while the sum is 37.
The spelling of 60105556045 in words is "sixty billion, one hundred five million, five hundred fifty-six thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •