Base | Representation |
---|---|
bin | 1111011011011010… |
… | …1111011111011010 |
3 | 101200122001022021122 |
4 | 3312312233133122 |
5 | 31440213423214 |
6 | 1522543405242 |
7 | 204426361325 |
oct | 36666573732 |
9 | 11618038248 |
10 | 4141545434 |
11 | 1835881424 |
12 | 976bb3822 |
13 | 510050300 |
14 | 2b407b7bc |
15 | 1938d488e |
hex | f6daf7da |
4141545434 has 12 divisors (see below), whose sum is σ = 6726948606. Its totient is φ = 1911482352.
The previous prime is 4141545433. The next prime is 4141545461. The reversal of 4141545434 is 4345451414.
It can be written as a sum of positive squares in 3 ways, for example, as 2456689225 + 1684856209 = 49565^2 + 41047^2 .
It is a Smith number, since the sum of its digits (35) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 4141545394 and 4141545403.
It is not an unprimeable number, because it can be changed into a prime (4141545433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6126209 + ... + 6126884.
Almost surely, 24141545434 is an apocalyptic number.
4141545434 is a deficient number, since it is larger than the sum of its proper divisors (2585403172).
4141545434 is a wasteful number, since it uses less digits than its factorization.
4141545434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12253121 (or 12253108 counting only the distinct ones).
The product of its digits is 76800, while the sum is 35.
The square root of 4141545434 is about 64354.8400200016. The cubic root of 4141545434 is about 1605.9085488502.
Adding to 4141545434 its reverse (4345451414), we get a palindrome (8486996848).
The spelling of 4141545434 in words is "four billion, one hundred forty-one million, five hundred forty-five thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •