Base | Representation |
---|---|
bin | 101010101100101111111… |
… | …1110010110001010100000 |
3 | 202210000201022220021120220 |
4 | 1111121133332112022200 |
5 | 1232122230042134233 |
6 | 20251545030403040 |
7 | 1143662531514561 |
oct | 125313776261240 |
9 | 22700638807526 |
10 | 5868535505568 |
11 | 1962917333a4a |
12 | 7a9440800480 |
13 | 337528c47c18 |
14 | 164078024168 |
15 | a29c278eeb3 |
hex | 5565ff962a0 |
5868535505568 has 48 divisors (see below), whose sum is σ = 15408315760320. Its totient is φ = 1955745478656.
The previous prime is 5868535505563. The next prime is 5868535505639. The reversal of 5868535505568 is 8655055358685.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×58685355055682 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5868535505563) 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 7 ways as a sum of consecutive naturals, for example, 6329905 + ... + 7197552.
It is an arithmetic number, because the mean of its divisors is an integer number (321006578340).
Almost surely, 25868535505568 is an apocalyptic number.
It is an amenable number.
5868535505568 is an abundant number, since it is smaller than the sum of its proper divisors (9539780254752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5868535505568 is a wasteful number, since it uses less digits than its factorization.
5868535505568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13531989 (or 13531981 counting only the distinct ones).
The product of its (nonzero) digits is 864000000, while the sum is 69.
The spelling of 5868535505568 in words is "five trillion, eight hundred sixty-eight billion, five hundred thirty-five million, five hundred five thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •