Base | Representation |
---|---|
bin | 100110010010011000… |
… | …111010101011110101 |
3 | 10221010002001111121000 |
4 | 212102120322223311 |
5 | 1133143320223104 |
6 | 30515213113513 |
7 | 2653522164243 |
oct | 462230725365 |
9 | 127102044530 |
10 | 41110711029 |
11 | 16486a19743 |
12 | 7b73a88899 |
13 | 3b5221361b |
14 | 1dbdcd7793 |
15 | 1109286639 |
hex | 99263aaf5 |
41110711029 has 96 divisors (see below), whose sum is σ = 64939190400. Its totient is φ = 25678598400.
The previous prime is 41110710997. The next prime is 41110711069. The reversal of 41110711029 is 92011701114.
It is not a de Polignac number, because 41110711029 - 25 = 41110710997 is a prime.
It is a super-2 number, since 2×411107110292 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 41110710993 and 41110711011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41110711069) 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 95 ways as a sum of consecutive naturals, for example, 295760442 + ... + 295760580.
It is an arithmetic number, because the mean of its divisors is an integer number (676449900).
Almost surely, 241110711029 is an apocalyptic number.
It is an amenable number.
41110711029 is a deficient number, since it is larger than the sum of its proper divisors (23828479371).
41110711029 is a wasteful number, since it uses less digits than its factorization.
41110711029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384 (or 307 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 27.
The spelling of 41110711029 in words is "forty-one billion, one hundred ten million, seven hundred eleven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •