Base | Representation |
---|---|
bin | 100110001100100000… |
… | …011010100011110100 |
3 | 10220212012100010202120 |
4 | 212030200122203310 |
5 | 1132443033411200 |
6 | 30501325435540 |
7 | 2651213234616 |
oct | 461440324364 |
9 | 126765303676 |
10 | 41012013300 |
11 | 16436237675 |
12 | 7b46a0bbb0 |
13 | 3b379377bb |
14 | 1db0b64db6 |
15 | 110078c9a0 |
hex | 98c81a8f4 |
41012013300 has 144 divisors (see below), whose sum is σ = 119364235200. Its totient is φ = 10872012800.
The previous prime is 41012013277. The next prime is 41012013349. The reversal of 41012013300 is 331021014.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 41012013300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 63980980 + ... + 63981620.
It is an arithmetic number, because the mean of its divisors is an integer number (828918300).
Almost surely, 241012013300 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 41012013300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59682117600).
41012013300 is an abundant number, since it is smaller than the sum of its proper divisors (78352221900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41012013300 is a wasteful number, since it uses less digits than its factorization.
41012013300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1586 (or 1579 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 41012013300 its reverse (331021014), we get a palindrome (41343034314).
The spelling of 41012013300 in words is "forty-one billion, twelve million, thirteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •