Base | Representation |
---|---|
bin | 100111000011111101011… |
… | …0110000010010010111101 |
3 | 201000020100112121112110122 |
4 | 1032013322312002102331 |
5 | 1200424414342400020 |
6 | 15230151114344325 |
7 | 1062604321230515 |
oct | 116077266022275 |
9 | 21006315545418 |
10 | 5368622621885 |
11 | 178a902568306 |
12 | 728584a2b0a5 |
13 | 2cc349b7c683 |
14 | 147bb25da845 |
15 | 949b4619125 |
hex | 4e1fad824bd |
5368622621885 has 4 divisors (see below), whose sum is σ = 6442347146268. Its totient is φ = 4294898097504.
The previous prime is 5368622621867. The next prime is 5368622621927. The reversal of 5368622621885 is 5881262268635.
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 2937583467844 + 2431039154041 = 1713938^2 + 1559179^2 .
It is a cyclic number.
It is not a de Polignac number, because 5368622621885 - 28 = 5368622621629 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 536862262184 + ... + 536862262193.
It is an arithmetic number, because the mean of its divisors is an integer number (1610586786567).
Almost surely, 25368622621885 is an apocalyptic number.
It is an amenable number.
5368622621885 is a deficient number, since it is larger than the sum of its proper divisors (1073724524383).
5368622621885 is a wasteful number, since it uses less digits than its factorization.
5368622621885 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1073724524382.
The product of its digits is 66355200, while the sum is 62.
The spelling of 5368622621885 in words is "five trillion, three hundred sixty-eight billion, six hundred twenty-two million, six hundred twenty-one thousand, eight hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •