Base | Representation |
---|---|
bin | 1010110100000010… |
… | …10101100100010101 |
3 | 112222120122010112002 |
4 | 11122001111210111 |
5 | 43342122022341 |
6 | 2400015005045 |
7 | 263600646215 |
oct | 53201254425 |
9 | 15876563462 |
10 | 5805267221 |
11 | 2509a16206 |
12 | 1160209785 |
13 | 716937080 |
14 | 3d0ddc245 |
15 | 23e9be29b |
hex | 15a055915 |
5805267221 has 8 divisors (see below), whose sum is σ = 6253197720. Its totient is φ = 5357532672.
The previous prime is 5805267199. The next prime is 5805267233. The reversal of 5805267221 is 1227625085.
It can be written as a sum of positive squares in 4 ways, for example, as 2723796100 + 3081471121 = 52190^2 + 55511^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5805267221 - 214 = 5805250837 is a prime.
It is a super-2 number, since 2×58052672212 = 67402255014434125682, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5805267271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15725 + ... + 108893.
It is an arithmetic number, because the mean of its divisors is an integer number (781649715).
Almost surely, 25805267221 is an apocalyptic number.
It is an amenable number.
5805267221 is a deficient number, since it is larger than the sum of its proper divisors (447930499).
5805267221 is a wasteful number, since it uses less digits than its factorization.
5805267221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97975.
The product of its (nonzero) digits is 67200, while the sum is 38.
The square root of 5805267221 is about 76192.3042111210. The cubic root of 5805267221 is about 1797.2455010980.
The spelling of 5805267221 in words is "five billion, eight hundred five million, two hundred sixty-seven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •