Base | Representation |
---|---|
bin | 100110001101110001… |
… | …001111001100011101 |
3 | 10220220200012120000110 |
4 | 212031301033030131 |
5 | 1133013444403123 |
6 | 30503403520233 |
7 | 2651561306622 |
oct | 461561171435 |
9 | 126820176013 |
10 | 41033200413 |
11 | 16447198887 |
12 | 7b51b29079 |
13 | 3b3c14535a |
14 | 1db38bc349 |
15 | 1102575493 |
hex | 98dc4f31d |
41033200413 has 16 divisors (see below), whose sum is σ = 57879872000. Its totient is φ = 25785468720.
The previous prime is 41033200391. The next prime is 41033200421. The reversal of 41033200413 is 31400233014.
It is not a de Polignac number, because 41033200413 - 25 = 41033200381 is a prime.
It is a super-2 number, since 2×410332004132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 41033200413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41033200213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1797403 + ... + 1820088.
It is an arithmetic number, because the mean of its divisors is an integer number (3617492000).
Almost surely, 241033200413 is an apocalyptic number.
It is an amenable number.
41033200413 is a deficient number, since it is larger than the sum of its proper divisors (16846671587).
41033200413 is a wasteful number, since it uses less digits than its factorization.
41033200413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3617712.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 41033200413 its reverse (31400233014), we get a palindrome (72433433427).
The spelling of 41033200413 in words is "forty-one billion, thirty-three million, two hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •