Base | Representation |
---|---|
bin | 1010100110000001… |
… | …00100100110011100 |
3 | 112200101021100022000 |
4 | 11103000210212130 |
5 | 43122013014030 |
6 | 2340213322300 |
7 | 260642011260 |
oct | 52300444634 |
9 | 15611240260 |
10 | 5687626140 |
11 | 2459575779 |
12 | 1128936390 |
13 | 6c8457a71 |
14 | 3bd5380a0 |
15 | 2344d2860 |
hex | 15302499c |
5687626140 has 96 divisors (see below), whose sum is σ = 20222684160. Its totient is φ = 1300027968.
The previous prime is 5687626129. The next prime is 5687626171. The reversal of 5687626140 is 416267865.
5687626140 is a `hidden beast` number, since 5 + 6 + 8 + 7 + 626 + 14 + 0 = 666.
It is a super-2 number, since 2×56876261402 = 64698182216822599200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 748552 + ... + 756111.
It is an arithmetic number, because the mean of its divisors is an integer number (210652960).
Almost surely, 25687626140 is an apocalyptic number.
It is an amenable number.
5687626140 is an abundant number, since it is smaller than the sum of its proper divisors (14535058020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5687626140 is a wasteful number, since it uses less digits than its factorization.
5687626140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1504688 (or 1504680 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The square root of 5687626140 is about 75416.3519404114. The cubic root of 5687626140 is about 1785.0224416358.
The spelling of 5687626140 in words is "five billion, six hundred eighty-seven million, six hundred twenty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •