Base | Representation |
---|---|
bin | 1001100111111011… |
… | …10011100010110101 |
3 | 111100002021000001102 |
4 | 10303331303202311 |
5 | 41040200312341 |
6 | 2212410335445 |
7 | 242016064622 |
oct | 46375634265 |
9 | 14302230042 |
10 | 5166807221 |
11 | 2211589814 |
12 | 100242a585 |
13 | 6445938a4 |
14 | 3702c3349 |
15 | 203905c9b |
hex | 133f738b5 |
5166807221 has 4 divisors (see below), whose sum is σ = 5175520812. Its totient is φ = 5158093632.
The previous prime is 5166807203. The next prime is 5166807251. The reversal of 5166807221 is 1227086615.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1227086615 = 5 ⋅245417323.
It can be written as a sum of positive squares in 2 ways, for example, as 4152384721 + 1014422500 = 64439^2 + 31850^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5166807221 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 (5166807251) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4355906 + ... + 4357091.
It is an arithmetic number, because the mean of its divisors is an integer number (1293880203).
Almost surely, 25166807221 is an apocalyptic number.
It is an amenable number.
5166807221 is a deficient number, since it is larger than the sum of its proper divisors (8713591).
5166807221 is an equidigital number, since it uses as much as digits as its factorization.
5166807221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8713590.
The product of its (nonzero) digits is 40320, while the sum is 38.
The square root of 5166807221 is about 71880.5065438468. The cubic root of 5166807221 is about 1728.7840722471.
The spelling of 5166807221 in words is "five billion, one hundred sixty-six million, eight hundred seven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •