Base | Representation |
---|---|
bin | 100110010100110010… |
… | …110011100011101011 |
3 | 10221012212222001000110 |
4 | 212110302303203223 |
5 | 1133234132131021 |
6 | 30523213505403 |
7 | 2654522112366 |
oct | 462462634353 |
9 | 127185861013 |
10 | 41151052011 |
11 | 164a77724a3 |
12 | 7b854a2263 |
13 | 3b5a699424 |
14 | 1dc53d90dd |
15 | 110caa4476 |
hex | 994cb38eb |
41151052011 has 4 divisors (see below), whose sum is σ = 54868069352. Its totient is φ = 27434034672.
The previous prime is 41151052009. The next prime is 41151052013. The reversal of 41151052011 is 11025015114.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (41151052009) and next prime (41151052013).
It is not a de Polignac number, because 41151052011 - 21 = 41151052009 is a prime.
It is a super-2 number, since 2×411510520112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41151052013) 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 3 ways as a sum of consecutive naturals, for example, 6858508666 + ... + 6858508671.
It is an arithmetic number, because the mean of its divisors is an integer number (13717017338).
Almost surely, 241151052011 is an apocalyptic number.
41151052011 is a deficient number, since it is larger than the sum of its proper divisors (13717017341).
41151052011 is a wasteful number, since it uses less digits than its factorization.
41151052011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13717017340.
The product of its (nonzero) digits is 200, while the sum is 21.
Adding to 41151052011 its reverse (11025015114), we get a palindrome (52176067125).
The spelling of 41151052011 in words is "forty-one billion, one hundred fifty-one million, fifty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •