Base | Representation |
---|---|
bin | 1001111000001101… |
… | …11011111100100101 |
3 | 111200121022120201101 |
4 | 10330012323330211 |
5 | 41330133344121 |
6 | 2234130400101 |
7 | 245265212662 |
oct | 47406737445 |
9 | 14617276641 |
10 | 5303418661 |
11 | 2281706a32 |
12 | 1040130031 |
13 | 666985768 |
14 | 3844c4a69 |
15 | 2108dd491 |
hex | 13c1bbf25 |
5303418661 has 2 divisors, whose sum is σ = 5303418662. Its totient is φ = 5303418660.
The previous prime is 5303418647. The next prime is 5303418691. The reversal of 5303418661 is 1668143035.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3590286561 + 1713132100 = 59919^2 + 41390^2 .
It is a cyclic number.
It is not a de Polignac number, because 5303418661 - 229 = 4766547749 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5303418661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5303418691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2651709330 + 2651709331.
It is an arithmetic number, because the mean of its divisors is an integer number (2651709331).
Almost surely, 25303418661 is an apocalyptic number.
It is an amenable number.
5303418661 is a deficient number, since it is larger than the sum of its proper divisors (1).
5303418661 is an equidigital number, since it uses as much as digits as its factorization.
5303418661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 37.
The square root of 5303418661 is about 72824.5745679300. The cubic root of 5303418661 is about 1743.8881937282. Note that the first 3 decimals are identical.
The spelling of 5303418661 in words is "five billion, three hundred three million, four hundred eighteen thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •