Base | Representation |
---|---|
bin | 1111100010011110… |
… | …1001111101010001 |
3 | 101202200202010022101 |
4 | 3320213221331101 |
5 | 32020303120131 |
6 | 1525522040401 |
7 | 205236101500 |
oct | 37047517521 |
9 | 11680663271 |
10 | 4171145041 |
11 | 1850559008 |
12 | 984aa9101 |
13 | 516214c7b |
14 | 2b7d84837 |
15 | 1962cec61 |
hex | f89e9f51 |
4171145041 has 12 divisors (see below), whose sum is σ = 5137569828. Its totient is φ = 3364956672.
The previous prime is 4171144987. The next prime is 4171145051. The reversal of 4171145041 is 1405411714.
It can be written as a sum of positive squares in 2 ways, for example, as 3584536641 + 586608400 = 59871^2 + 24220^2 .
It is not a de Polignac number, because 4171145041 - 225 = 4137590609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4171145051) 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 in 11 ways as a sum of consecutive naturals, for example, 2502856 + ... + 2504521.
It is an arithmetic number, because the mean of its divisors is an integer number (428130819).
Almost surely, 24171145041 is an apocalyptic number.
It is an amenable number.
4171145041 is a deficient number, since it is larger than the sum of its proper divisors (966424787).
4171145041 is a wasteful number, since it uses less digits than its factorization.
4171145041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5007408 (or 5007401 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 28.
The square root of 4171145041 is about 64584.4024591077. The cubic root of 4171145041 is about 1609.7252776371.
Adding to 4171145041 its reverse (1405411714), we get a palindrome (5576556755).
The spelling of 4171145041 in words is "four billion, one hundred seventy-one million, one hundred forty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •