Base | Representation |
---|---|
bin | 10010101001101010101111… |
… | …00001111101101010110010 |
3 | 12101012220120221010020010110 |
4 | 21110311113201331222302 |
5 | 20333433344433340032 |
6 | 223121342251242150 |
7 | 11432112624216624 |
oct | 1124652741755262 |
9 | 171186527106113 |
10 | 41014111230642 |
11 | 12082a94610450 |
12 | 4724986a49356 |
13 | 19b67ca218704 |
14 | a1b144ab0c14 |
15 | 4b1d102387cc |
hex | 254d5787dab2 |
41014111230642 has 64 divisors (see below), whose sum is σ = 91013939020800. Its totient is φ = 12216267362880.
The previous prime is 41014111230611. The next prime is 41014111230643. The reversal of 41014111230642 is 24603211141014.
It is not an unprimeable number, because it can be changed into a prime (41014111230643) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29248084 + ... + 30618272.
It is an arithmetic number, because the mean of its divisors is an integer number (1422092797200).
Almost surely, 241014111230642 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41014111230642, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45506969510400).
41014111230642 is an abundant number, since it is smaller than the sum of its proper divisors (49999827790158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41014111230642 is a wasteful number, since it uses less digits than its factorization.
41014111230642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1377951.
The product of its (nonzero) digits is 4608, while the sum is 30.
Adding to 41014111230642 its reverse (24603211141014), we get a palindrome (65617322371656).
The spelling of 41014111230642 in words is "forty-one trillion, fourteen billion, one hundred eleven million, two hundred thirty thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •