Base | Representation |
---|---|
bin | 1111111000011101… |
… | …0111101110010001 |
3 | 102000010020100221012 |
4 | 3332013113232101 |
5 | 32212404020131 |
6 | 1543014140305 |
7 | 210435556244 |
oct | 37607275621 |
9 | 12003210835 |
10 | 4263345041 |
11 | 189860225a |
12 | 9ab951695 |
13 | 52c357397 |
14 | 2c630525b |
15 | 19e44352b |
hex | fe1d7b91 |
4263345041 has 2 divisors, whose sum is σ = 4263345042. Its totient is φ = 4263345040.
The previous prime is 4263345019. The next prime is 4263345061. The reversal of 4263345041 is 1405433624.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3251850625 + 1011494416 = 57025^2 + 31804^2 .
It is a cyclic number.
It is not a de Polignac number, because 4263345041 - 26 = 4263344977 is a prime.
It is a super-2 number, since 2×42633450412 = 36352221877238583362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4263344989 and 4263345007.
It is not a weakly prime, because it can be changed into another prime (4263345061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2131672520 + 2131672521.
It is an arithmetic number, because the mean of its divisors is an integer number (2131672521).
Almost surely, 24263345041 is an apocalyptic number.
It is an amenable number.
4263345041 is a deficient number, since it is larger than the sum of its proper divisors (1).
4263345041 is an equidigital number, since it uses as much as digits as its factorization.
4263345041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34560, while the sum is 32.
The square root of 4263345041 is about 65294.2956237373. The cubic root of 4263345041 is about 1621.4995312530.
Adding to 4263345041 its reverse (1405433624), we get a palindrome (5668778665).
The spelling of 4263345041 in words is "four billion, two hundred sixty-three million, three hundred forty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •