Base | Representation |
---|---|
bin | 100110001110000000… |
… | …000111100111000000 |
3 | 10220220221112202022022 |
4 | 212032000013213000 |
5 | 1133020444222004 |
6 | 30504023301012 |
7 | 2651636415230 |
oct | 461600074700 |
9 | 126827482268 |
10 | 41037101504 |
11 | 16449412823 |
12 | 7b532aa768 |
13 | 3b3cbacba9 |
14 | 1db4215cc0 |
15 | 1102a962be |
hex | 98e0079c0 |
41037101504 has 56 divisors (see below), whose sum is σ = 93198269280. Its totient is φ = 17562387456.
The previous prime is 41037101503. The next prime is 41037101603. The reversal of 41037101504 is 40510173014.
It is a tau number, because it is divible by the number of its divisors (56).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41037101503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 253034 + ... + 382230.
Almost surely, 241037101504 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 41037101504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46599134640).
41037101504 is an abundant number, since it is smaller than the sum of its proper divisors (52161167776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41037101504 is a wasteful number, since it uses less digits than its factorization.
41037101504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129925 (or 129915 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 26.
Adding to 41037101504 its reverse (40510173014), we get a palindrome (81547274518).
The spelling of 41037101504 in words is "forty-one billion, thirty-seven million, one hundred one thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •