Base | Representation |
---|---|
bin | 100110100100011110… |
… | …110000010101101100 |
3 | 10221220020011221021101 |
4 | 212210132300111230 |
5 | 1134304020401104 |
6 | 31005254412444 |
7 | 2664166105300 |
oct | 464436602554 |
9 | 127806157241 |
10 | 41414231404 |
11 | 16622288027 |
12 | 8039661124 |
13 | 3ba0074890 |
14 | 200c345d00 |
15 | 1125c3d5a4 |
hex | 9a47b056c |
41414231404 has 72 divisors (see below), whose sum is σ = 90931410528. Its totient is φ = 16358630400.
The previous prime is 41414231363. The next prime is 41414231413. The reversal of 41414231404 is 40413241414.
It is a super-2 number, since 2×414142314042 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 1702729 + ... + 1726879.
Almost surely, 241414231404 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41414231404, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45465705264).
41414231404 is an abundant number, since it is smaller than the sum of its proper divisors (49517179124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41414231404 is a wasteful number, since it uses less digits than its factorization.
41414231404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24855 (or 24846 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 41414231404 its reverse (40413241414), we get a palindrome (81827472818).
The spelling of 41414231404 in words is "forty-one billion, four hundred fourteen million, two hundred thirty-one thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •