Base | Representation |
---|---|
bin | 100110010011110010… |
… | …111001101101100010 |
3 | 10221011201102221120200 |
4 | 212103302321231202 |
5 | 1133220340100002 |
6 | 30521414450030 |
7 | 2654226531615 |
oct | 462362715542 |
9 | 127151387520 |
10 | 41134300002 |
11 | 16499270464 |
12 | 7b7b963916 |
13 | 3b570824b3 |
14 | 1dc30b817c |
15 | 110b395b1c |
hex | 993cb9b62 |
41134300002 has 288 divisors, whose sum is σ = 104826009600. Its totient is φ = 11607515136.
The previous prime is 41134300001. The next prime is 41134300037. The reversal of 41134300002 is 20000343114.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (41134300001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 323892063 + ... + 323892189.
It is an arithmetic number, because the mean of its divisors is an integer number (363979200).
Almost surely, 241134300002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41134300002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52413004800).
41134300002 is an abundant number, since it is smaller than the sum of its proper divisors (63691709598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41134300002 is a wasteful number, since it uses less digits than its factorization.
41134300002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330 (or 310 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 41134300002 its reverse (20000343114), we get a palindrome (61134643116).
The spelling of 41134300002 in words is "forty-one billion, one hundred thirty-four million, three hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •