Base | Representation |
---|---|
bin | 100110001100000110… |
… | …111100001001000001 |
3 | 10220211201202212000000 |
4 | 212030012330021001 |
5 | 1132434331210410 |
6 | 30500530350213 |
7 | 2651102411640 |
oct | 461406741101 |
9 | 126751685000 |
10 | 41005335105 |
11 | 164324961a9 |
12 | 7b4472b369 |
13 | 3b36439bc7 |
14 | 1dadd07357 |
15 | 10eedbddc0 |
hex | 98c1bc241 |
41005335105 has 56 divisors (see below), whose sum is σ = 84315314112. Its totient is φ = 18745284384.
The previous prime is 41005335103. The next prime is 41005335113. The reversal of 41005335105 is 50153350014.
It is not a de Polignac number, because 41005335105 - 21 = 41005335103 is a prime.
It is a super-2 number, since 2×410053351052 (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 Curzon number.
It is not an unprimeable number, because it can be changed into a prime (41005335103) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 778039 + ... + 829068.
Almost surely, 241005335105 is an apocalyptic number.
41005335105 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
41005335105 is an abundant number, since it is smaller than the sum of its proper divisors (43309979007).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41005335105 is an equidigital number, since it uses as much as digits as its factorization.
41005335105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1607137 (or 1607122 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
Adding to 41005335105 its reverse (50153350014), we get a palindrome (91158685119).
The spelling of 41005335105 in words is "forty-one billion, five million, three hundred thirty-five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •