Base | Representation |
---|---|
bin | 1000110101100100… |
… | …11111111100101001 |
3 | 110020122110011001212 |
4 | 10122302133330221 |
5 | 34204032203334 |
6 | 2102441122505 |
7 | 225366562532 |
oct | 43262377451 |
9 | 13218404055 |
10 | 4744412969 |
11 | 201510875a |
12 | b04a89435 |
13 | 5a7c1116a |
14 | 33016d689 |
15 | 1cb7bbece |
hex | 11ac9ff29 |
4744412969 has 2 divisors, whose sum is σ = 4744412970. Its totient is φ = 4744412968.
The previous prime is 4744412957. The next prime is 4744412971. The reversal of 4744412969 is 9692144474.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2765497744 + 1978915225 = 52588^2 + 44485^2 .
It is a cyclic number.
It is not a de Polignac number, because 4744412969 - 220 = 4743364393 is a prime.
It is a super-2 number, since 2×47444129692 = 45018908840830789922, which contains 22 as substring.
Together with 4744412971, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (4744412999) 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, 2372206484 + 2372206485.
It is an arithmetic number, because the mean of its divisors is an integer number (2372206485).
Almost surely, 24744412969 is an apocalyptic number.
It is an amenable number.
4744412969 is a deficient number, since it is larger than the sum of its proper divisors (1).
4744412969 is an equidigital number, since it uses as much as digits as its factorization.
4744412969 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1741824, while the sum is 50.
The square root of 4744412969 is about 68879.6992516663. The cubic root of 4744412969 is about 1680.3283760272.
The spelling of 4744412969 in words is "four billion, seven hundred forty-four million, four hundred twelve thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •