Base | Representation |
---|---|
bin | 10011011010000101001000… |
… | …11001010001011100111000 |
3 | 12121002221020001112201000002 |
4 | 21231002210121101130320 |
5 | 21043212112101012220 |
6 | 230433444112332132 |
7 | 11663231360163251 |
oct | 1155024431213470 |
9 | 177087201481002 |
10 | 42677553141560 |
11 | 126644a3168577 |
12 | 4953242244048 |
13 | 1aa76259a9cbc |
14 | a7786700bb28 |
15 | 4e021b305c75 |
hex | 26d0a4651738 |
42677553141560 has 64 divisors (see below), whose sum is σ = 96347499494400. Its totient is φ = 17013609968256.
The previous prime is 42677553141547. The next prime is 42677553141563. The reversal of 42677553141560 is 6514135577624.
It is a junction number, because it is equal to n+sod(n) for n = 42677553141496 and 42677553141505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42677553141563) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 118678589 + ... + 119037651.
It is an arithmetic number, because the mean of its divisors is an integer number (1505429679600).
Almost surely, 242677553141560 is an apocalyptic number.
42677553141560 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
42677553141560 is an abundant number, since it is smaller than the sum of its proper divisors (53669946352840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42677553141560 is a wasteful number, since it uses less digits than its factorization.
42677553141560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 369060 (or 369056 counting only the distinct ones).
The product of its (nonzero) digits is 21168000, while the sum is 56.
The spelling of 42677553141560 in words is "forty-two trillion, six hundred seventy-seven billion, five hundred fifty-three million, one hundred forty-one thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •