Base | Representation |
---|---|
bin | 1001001001101110… |
… | …00001000101100001 |
3 | 110200102101000202222 |
4 | 10210313001011201 |
5 | 40030310310231 |
6 | 2131314320425 |
7 | 232520644151 |
oct | 44467010541 |
9 | 13612330688 |
10 | 4913369441 |
11 | 20a1518202 |
12 | b51589115 |
13 | 603c194c6 |
14 | 348790761 |
15 | 1db54327b |
hex | 124dc1161 |
4913369441 has 2 divisors, whose sum is σ = 4913369442. Its totient is φ = 4913369440.
The previous prime is 4913369437. The next prime is 4913369443. The reversal of 4913369441 is 1449633194.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2522550625 + 2390818816 = 50225^2 + 48896^2 .
It is a cyclic number.
It is not a de Polignac number, because 4913369441 - 22 = 4913369437 is a prime.
Together with 4913369443, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 4913369392 and 4913369401.
It is not a weakly prime, because it can be changed into another prime (4913369443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2456684720 + 2456684721.
It is an arithmetic number, because the mean of its divisors is an integer number (2456684721).
Almost surely, 24913369441 is an apocalyptic number.
It is an amenable number.
4913369441 is a deficient number, since it is larger than the sum of its proper divisors (1).
4913369441 is an equidigital number, since it uses as much as digits as its factorization.
4913369441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 279936, while the sum is 44.
The square root of 4913369441 is about 70095.4309566608. The cubic root of 4913369441 is about 1700.0426103507.
The spelling of 4913369441 in words is "four billion, nine hundred thirteen million, three hundred sixty-nine thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •