Base | Representation |
---|---|
bin | 1111000101101000… |
… | …0110101110010101 |
3 | 101110021002001112021 |
4 | 3301122012232111 |
5 | 31243314333331 |
6 | 1505520453141 |
7 | 202236504214 |
oct | 36132065625 |
9 | 11407061467 |
10 | 4050152341 |
11 | 1799229444 |
12 | 95047a1b1 |
13 | 4c7131261 |
14 | 2a5c8b07b |
15 | 18a880211 |
hex | f1686b95 |
4050152341 has 2 divisors, whose sum is σ = 4050152342. Its totient is φ = 4050152340.
The previous prime is 4050152339. The next prime is 4050152371. The reversal of 4050152341 is 1432510504.
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., 3688011441 + 362140900 = 60729^2 + 19030^2 .
It is a cyclic number.
It is not a de Polignac number, because 4050152341 - 21 = 4050152339 is a prime.
Together with 4050152339, 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 (4050152321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2025076170 + 2025076171.
It is an arithmetic number, because the mean of its divisors is an integer number (2025076171).
Almost surely, 24050152341 is an apocalyptic number.
It is an amenable number.
4050152341 is a deficient number, since it is larger than the sum of its proper divisors (1).
4050152341 is an equidigital number, since it uses as much as digits as its factorization.
4050152341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 4050152341 is about 63640.8071994691. The cubic root of 4050152341 is about 1594.0078395072.
Adding to 4050152341 its reverse (1432510504), we get a palindrome (5482662845).
The spelling of 4050152341 in words is "four billion, fifty million, one hundred fifty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •