Base | Representation |
---|---|
bin | 10010110101111001010010… |
… | …01010000110111000111111 |
3 | 12102201002000102120001012101 |
4 | 21122330221022012320333 |
5 | 20412324310421120111 |
6 | 224042343241245531 |
7 | 11504345044054045 |
oct | 1132745112067077 |
9 | 172632012501171 |
10 | 41434240020031 |
11 | 12225187337181 |
12 | 47922971938a7 |
13 | 1a17302b15101 |
14 | a335dc2c2395 |
15 | 4bcbedd3cbc1 |
hex | 25af29286e3f |
41434240020031 has 8 divisors (see below), whose sum is σ = 41623464945600. Its totient is φ = 41245087176480.
The previous prime is 41434240020023. The next prime is 41434240020037. The reversal of 41434240020031 is 13002004243414.
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 41434240020031 - 23 = 41434240020023 is a prime.
It is a super-2 number, since 2×414342400200312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41434240020037) 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, 16868071 + ... + 19167688.
It is an arithmetic number, because the mean of its divisors is an integer number (5202933118200).
Almost surely, 241434240020031 is an apocalyptic number.
41434240020031 is a deficient number, since it is larger than the sum of its proper divisors (189224925569).
41434240020031 is a wasteful number, since it uses less digits than its factorization.
41434240020031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36041009.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 41434240020031 its reverse (13002004243414), we get a palindrome (54436244263445).
The spelling of 41434240020031 in words is "forty-one trillion, four hundred thirty-four billion, two hundred forty million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •