Base | Representation |
---|---|
bin | 1111000101111011… |
… | …1010110000110101 |
3 | 101110100110011021221 |
4 | 3301132322300311 |
5 | 31244130222234 |
6 | 1510003510341 |
7 | 202253310553 |
oct | 36136726065 |
9 | 11410404257 |
10 | 4051414069 |
11 | 1799a1039a |
12 | 9509883b1 |
13 | 4c7483641 |
14 | 2a60d8bd3 |
15 | 18aa2deb4 |
hex | f17bac35 |
4051414069 has 2 divisors, whose sum is σ = 4051414070. Its totient is φ = 4051414068.
The previous prime is 4051414067. The next prime is 4051414153. The reversal of 4051414069 is 9604141504.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2874032100 + 1177381969 = 53610^2 + 34313^2 .
It is a cyclic number.
It is not a de Polignac number, because 4051414069 - 21 = 4051414067 is a prime.
It is a super-2 number, since 2×40514140692 = 32827911916982273522, which contains 22 as substring.
Together with 4051414067, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4051414067) 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, 2025707034 + 2025707035.
It is an arithmetic number, because the mean of its divisors is an integer number (2025707035).
Almost surely, 24051414069 is an apocalyptic number.
It is an amenable number.
4051414069 is a deficient number, since it is larger than the sum of its proper divisors (1).
4051414069 is an equidigital number, since it uses as much as digits as its factorization.
4051414069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 34.
The square root of 4051414069 is about 63650.7193125105. The cubic root of 4051414069 is about 1594.1733473155.
The spelling of 4051414069 in words is "four billion, fifty-one million, four hundred fourteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •