Base | Representation |
---|---|
bin | 1001100111111011… |
… | …00101111110000101 |
3 | 111100002011011210011 |
4 | 10303331211332011 |
5 | 41040142022441 |
6 | 2212405230221 |
7 | 242015443543 |
oct | 46375457605 |
9 | 14302134704 |
10 | 5166751621 |
11 | 2211550a69 |
12 | 1002402371 |
13 | 6445744a5 |
14 | 3702aad93 |
15 | 2038e4581 |
hex | 133f65f85 |
5166751621 has 12 divisors (see below), whose sum is σ = 5411261700. Its totient is φ = 4932464768.
The previous prime is 5166751573. The next prime is 5166751627. The reversal of 5166751621 is 1261576615.
It can be written as a sum of positive squares in 6 ways, for example, as 324540225 + 4842211396 = 18015^2 + 69586^2 .
It is not a de Polignac number, because 5166751621 - 219 = 5166227333 is a prime.
It is a super-2 number, since 2×51667516212 = 53390644626212255282, 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 (5166751627) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 40335 + ... + 109363.
It is an arithmetic number, because the mean of its divisors is an integer number (450938475).
Almost surely, 25166751621 is an apocalyptic number.
It is an amenable number.
5166751621 is a deficient number, since it is larger than the sum of its proper divisors (244510079).
5166751621 is an equidigital number, since it uses as much as digits as its factorization.
5166751621 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69176 (or 69147 counting only the distinct ones).
The product of its digits is 75600, while the sum is 40.
The square root of 5166751621 is about 71880.1197898278. The cubic root of 5166751621 is about 1728.7778710778. Note that the first 3 decimals are identical.
The spelling of 5166751621 in words is "five billion, one hundred sixty-six million, seven hundred fifty-one thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •