Base | Representation |
---|---|
bin | 100110010100110001… |
… | …000011010000000101 |
3 | 10221012212002200000012 |
4 | 212110301003100011 |
5 | 1133234022421010 |
6 | 30523200000005 |
7 | 2654515155305 |
oct | 462461032005 |
9 | 127185080005 |
10 | 41150592005 |
11 | 164a7488926 |
12 | 7b85300005 |
13 | 3b5a567c33 |
14 | 1dc5319605 |
15 | 110ca13005 |
hex | 994c43405 |
41150592005 has 4 divisors (see below), whose sum is σ = 49380710412. Its totient is φ = 32920473600.
The previous prime is 41150592001. The next prime is 41150592011. The reversal of 41150592005 is 50029505114.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50029505114 = 2 ⋅25014752557.
It can be written as a sum of positive squares in 2 ways, for example, as 32920110721 + 8230481284 = 181439^2 + 90722^2 .
It is not a de Polignac number, because 41150592005 - 22 = 41150592001 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41150592001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4115059196 + ... + 4115059205.
It is an arithmetic number, because the mean of its divisors is an integer number (12345177603).
Almost surely, 241150592005 is an apocalyptic number.
It is an amenable number.
41150592005 is a deficient number, since it is larger than the sum of its proper divisors (8230118407).
41150592005 is an equidigital number, since it uses as much as digits as its factorization.
41150592005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8230118406.
The product of its (nonzero) digits is 9000, while the sum is 32.
The spelling of 41150592005 in words is "forty-one billion, one hundred fifty million, five hundred ninety-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •