Base | Representation |
---|---|
bin | 100110001110100000… |
… | …101001100001111010 |
3 | 10220221112120222220100 |
4 | 212032200221201322 |
5 | 1133030140112200 |
6 | 30504530140230 |
7 | 2652102042666 |
oct | 461640514172 |
9 | 126845528810 |
10 | 41045629050 |
11 | 16453207688 |
12 | 7b56121676 |
13 | 3b418a748a |
14 | 1db53d58a6 |
15 | 11036ccd00 |
hex | 98e82987a |
41045629050 has 144 divisors (see below), whose sum is σ = 113969276928. Its totient is φ = 10579766400.
The previous prime is 41045629049. The next prime is 41045629159. The reversal of 41045629050 is 5092654014.
41045629050 is a `hidden beast` number, since 4 + 1 + 0 + 4 + 562 + 90 + 5 + 0 = 666.
It is a super-2 number, since 2×410456290502 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 41045628996 and 41045629014.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 19152279 + ... + 19154421.
It is an arithmetic number, because the mean of its divisors is an integer number (791453312).
Almost surely, 241045629050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41045629050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56984638464).
41045629050 is an abundant number, since it is smaller than the sum of its proper divisors (72923647878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41045629050 is a wasteful number, since it uses less digits than its factorization.
41045629050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3565 (or 3557 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The spelling of 41045629050 in words is "forty-one billion, forty-five million, six hundred twenty-nine thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.181 sec. • engine limits •