Base | Representation |
---|---|
bin | 1111000001011010… |
… | …0110010101101001 |
3 | 101102000202222202202 |
4 | 3300112212111221 |
5 | 31224302043131 |
6 | 1504045305545 |
7 | 201633211415 |
oct | 36026462551 |
9 | 11360688682 |
10 | 4032456041 |
11 | 178a2419a9 |
12 | 9465652b5 |
13 | 4c3576583 |
14 | 2a37a1d45 |
15 | 189036bcb |
hex | f05a6569 |
4032456041 has 2 divisors, whose sum is σ = 4032456042. Its totient is φ = 4032456040.
The previous prime is 4032456023. The next prime is 4032456053. The reversal of 4032456041 is 1406542304.
4032456041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4031742016 + 714025 = 63496^2 + 845^2 .
It is a cyclic number.
It is not a de Polignac number, because 4032456041 - 230 = 2958714217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4032455995 and 4032456013.
It is not a weakly prime, because it can be changed into another prime (4032456941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2016228020 + 2016228021.
It is an arithmetic number, because the mean of its divisors is an integer number (2016228021).
Almost surely, 24032456041 is an apocalyptic number.
It is an amenable number.
4032456041 is a deficient number, since it is larger than the sum of its proper divisors (1).
4032456041 is an equidigital number, since it uses as much as digits as its factorization.
4032456041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11520, while the sum is 29.
The square root of 4032456041 is about 63501.6223493542. The cubic root of 4032456041 is about 1591.6828879475.
Adding to 4032456041 its reverse (1406542304), we get a palindrome (5438998345).
The spelling of 4032456041 in words is "four billion, thirty-two million, four hundred fifty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •