Base | Representation |
---|---|
bin | 1111001000100101… |
… | …1000010010010001 |
3 | 101111010101200010011 |
4 | 3302021120102101 |
5 | 31310002420131 |
6 | 1511042234521 |
7 | 202450030432 |
oct | 36211302221 |
9 | 11433350104 |
10 | 4062545041 |
11 | 17a5223245 |
12 | 954655a41 |
13 | 4c987cc09 |
14 | 2a7795489 |
15 | 18b9cc0b1 |
hex | f2258491 |
4062545041 has 2 divisors, whose sum is σ = 4062545042. Its totient is φ = 4062545040.
The previous prime is 4062545027. The next prime is 4062545083. The reversal of 4062545041 is 1405452604.
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., 2255870016 + 1806675025 = 47496^2 + 42505^2 .
It is a cyclic number.
It is not a de Polignac number, because 4062545041 - 211 = 4062542993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4062544994 and 4062545012.
It is not a weakly prime, because it can be changed into another prime (4062545341) 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, 2031272520 + 2031272521.
It is an arithmetic number, because the mean of its divisors is an integer number (2031272521).
Almost surely, 24062545041 is an apocalyptic number.
It is an amenable number.
4062545041 is a deficient number, since it is larger than the sum of its proper divisors (1).
4062545041 is an equidigital number, since it uses as much as digits as its factorization.
4062545041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19200, while the sum is 31.
The square root of 4062545041 is about 63738.0972496042. The cubic root of 4062545041 is about 1595.6319716035.
Adding to 4062545041 its reverse (1405452604), we get a palindrome (5467997645).
The spelling of 4062545041 in words is "four billion, sixty-two million, five hundred forty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •