Base | Representation |
---|---|
bin | 100110001111010010… |
… | …101100001011000000 |
3 | 10220222110021110110000 |
4 | 212033102230023000 |
5 | 1133042014401242 |
6 | 30510115240000 |
7 | 2652321406650 |
oct | 461722541300 |
9 | 126873243400 |
10 | 41058747072 |
11 | 1645a657422 |
12 | 7b5a5a9000 |
13 | 3b4451b315 |
14 | 1db704c360 |
15 | 110491ea4c |
hex | 98f4ac2c0 |
41058747072 has 1120 divisors, whose sum is σ = 161449390080. Its totient is φ = 10032906240.
The previous prime is 41058747047. The next prime is 41058747083. The reversal of 41058747072 is 27074785014.
41058747072 is a `hidden beast` number, since 4 + 105 + 8 + 7 + 470 + 72 = 666.
It is a super-2 number, since 2×410587470722 (a number of 22 digits) contains 22 as substring.
It is an alternating number because its digits alternate between even and odd.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 363351688 + ... + 363351800.
Almost surely, 241058747072 is an apocalyptic number.
41058747072 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41058747072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80724695040).
41058747072 is an abundant number, since it is smaller than the sum of its proper divisors (120390643008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41058747072 is a wasteful number, since it uses less digits than its factorization.
41058747072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211 (or 192 counting only the distinct ones).
The product of its (nonzero) digits is 439040, while the sum is 45.
The spelling of 41058747072 in words is "forty-one billion, fifty-eight million, seven hundred forty-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •