Base | Representation |
---|---|
bin | 101010001111001110110… |
… | …0001101001110111000101 |
3 | 202112222002102221222012121 |
4 | 1110132131201221313011 |
5 | 1230102413234141041 |
6 | 20202502435245541 |
7 | 1136256604653304 |
oct | 124363541516705 |
9 | 22488072858177 |
10 | 5805143662021 |
11 | 1938a47291700 |
12 | 7990aaa498b1 |
13 | 33156588c622 |
14 | 160d82cc843b |
15 | a10123967d1 |
hex | 5479d869dc5 |
5805143662021 has 24 divisors (see below), whose sum is σ = 6445548517464. Its totient is φ = 5223926400000.
The previous prime is 5805143661959. The next prime is 5805143662051. The reversal of 5805143662021 is 1202663415085.
It can be written as a sum of positive squares in 4 ways, for example, as 1227730480900 + 4577413181121 = 1108030^2 + 2139489^2 .
It is not a de Polignac number, because 5805143662021 - 221 = 5805141564869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5805143662051) 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 23 ways as a sum of consecutive naturals, for example, 54219981 + ... + 54326941.
It is an arithmetic number, because the mean of its divisors is an integer number (268564521561).
Almost surely, 25805143662021 is an apocalyptic number.
It is an amenable number.
5805143662021 is a deficient number, since it is larger than the sum of its proper divisors (640404855443).
5805143662021 is a wasteful number, since it uses less digits than its factorization.
5805143662021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111525 (or 111514 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 43.
The spelling of 5805143662021 in words is "five trillion, eight hundred five billion, one hundred forty-three million, six hundred sixty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •