Base | Representation |
---|---|
bin | 10010101101010110000001… |
… | …11010000011010110000011 |
3 | 12101122222122112012101112221 |
4 | 21112223000322003112003 |
5 | 20343021101400021421 |
6 | 223255353141431511 |
7 | 11444204200250206 |
oct | 1126530072032603 |
9 | 171588575171487 |
10 | 41140433204611 |
11 | 12121618019144 |
12 | 474535ba0b597 |
13 | 19c56ac0c1380 |
14 | a232c98b993d |
15 | 4b5255226841 |
hex | 256ac0e83583 |
41140433204611 has 8 divisors (see below), whose sum is σ = 46231389822240. Its totient is φ = 36324663431232.
The previous prime is 41140433204597. The next prime is 41140433204623. The reversal of 41140433204611 is 11640233404114.
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 41140433204611 - 211 = 41140433202563 is a prime.
It is a super-2 number, since 2×411404332046112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41140433204411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 68796710746 + ... + 68796711343.
It is an arithmetic number, because the mean of its divisors is an integer number (5778923727780).
Almost surely, 241140433204611 is an apocalyptic number.
41140433204611 is a deficient number, since it is larger than the sum of its proper divisors (5090956617629).
41140433204611 is a wasteful number, since it uses less digits than its factorization.
41140433204611 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137593422125.
The product of its (nonzero) digits is 27648, while the sum is 34.
Adding to 41140433204611 its reverse (11640233404114), we get a palindrome (52780666608725).
The spelling of 41140433204611 in words is "forty-one trillion, one hundred forty billion, four hundred thirty-three million, two hundred four thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •