Base | Representation |
---|---|
bin | 100101011100110001… |
… | …100100100101011001 |
3 | 10211210101110211112012 |
4 | 211130301210211121 |
5 | 1124323032020231 |
6 | 30250041355305 |
7 | 2622320412122 |
oct | 453461444531 |
9 | 124711424465 |
10 | 40211204441 |
11 | 160651a4071 |
12 | 7962798b35 |
13 | 3a3aa606c5 |
14 | 1d36669049 |
15 | 10a5305e2b |
hex | 95cc64959 |
40211204441 has 8 divisors (see below), whose sum is σ = 40768040040. Its totient is φ = 39654531072.
The previous prime is 40211204399. The next prime is 40211204533. The reversal of 40211204441 is 14440211204.
It can be written as a sum of positive squares in 4 ways, for example, as 5956598041 + 34254606400 = 77179^2 + 185080^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40211204441 - 214 = 40211188057 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (40211204041) 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 in 7 ways as a sum of consecutive naturals, for example, 509921 + ... + 583473.
It is an arithmetic number, because the mean of its divisors is an integer number (5096005005).
Almost surely, 240211204441 is an apocalyptic number.
It is an amenable number.
40211204441 is a deficient number, since it is larger than the sum of its proper divisors (556835599).
40211204441 is an equidigital number, since it uses as much as digits as its factorization.
40211204441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81115.
The product of its (nonzero) digits is 1024, while the sum is 23.
Adding to 40211204441 its reverse (14440211204), we get a palindrome (54651415645).
The spelling of 40211204441 in words is "forty billion, two hundred eleven million, two hundred four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •