Base | Representation |
---|---|
bin | 100000100010110000111… |
… | …0101101010111110011101 |
3 | 120211120211022200101220201 |
4 | 1001011201311222332131 |
5 | 1041240043304232444 |
6 | 13302421531143501 |
7 | 641066510145022 |
oct | 101054165527635 |
9 | 16746738611821 |
10 | 4472702414749 |
11 | 1474953a01258 |
12 | 602a0aba4b91 |
13 | 265a0a701caa |
14 | 1166a0db9549 |
15 | 7b52a374dd4 |
hex | 41161d6af9d |
4472702414749 has 2 divisors, whose sum is σ = 4472702414750. Its totient is φ = 4472702414748.
The previous prime is 4472702414711. The next prime is 4472702414773. The reversal of 4472702414749 is 9474142072744.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2586570991524 + 1886131423225 = 1608282^2 + 1373365^2 .
It is a cyclic number.
It is not a de Polignac number, because 4472702414749 - 221 = 4472700317597 is a prime.
It is a super-2 number, since 2×44727024147492 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4472702414749.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4472702414549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2236351207374 + 2236351207375.
It is an arithmetic number, because the mean of its divisors is an integer number (2236351207375).
Almost surely, 24472702414749 is an apocalyptic number.
It is an amenable number.
4472702414749 is a deficient number, since it is larger than the sum of its proper divisors (1).
4472702414749 is an equidigital number, since it uses as much as digits as its factorization.
4472702414749 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12644352, while the sum is 55.
The spelling of 4472702414749 in words is "four trillion, four hundred seventy-two billion, seven hundred two million, four hundred fourteen thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •