Base | Representation |
---|---|
bin | 10010101001010011000100… |
… | …11111000101000101110100 |
3 | 12101011200210202202001122222 |
4 | 21110221202133011011310 |
5 | 20333231341442401400 |
6 | 223111442054341512 |
7 | 11431153110453641 |
oct | 1124514237050564 |
9 | 171150722661588 |
10 | 41001410122100 |
11 | 1207866712262a |
12 | 472242135a898 |
13 | 19b5554a4707c |
14 | a1a69bd0adc8 |
15 | 4b181a177185 |
hex | 254a627c5174 |
41001410122100 has 18 divisors (see below), whose sum is σ = 88973059965174. Its totient is φ = 16400564048800.
The previous prime is 41001410122069. The next prime is 41001410122171. The reversal of 41001410122100 is 122101410014.
It can be written as a sum of positive squares in 3 ways, for example, as 1044573937936 + 39956836184164 = 1022044^2 + 6321142^2 .
It is a super-2 number, since 2×410014101221002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 205007050511 + ... + 205007050710.
It is an arithmetic number, because the mean of its divisors is an integer number (4942947775843).
Almost surely, 241001410122100 is an apocalyptic number.
It is an amenable number.
41001410122100 is an abundant number, since it is smaller than the sum of its proper divisors (47971649843074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41001410122100 is a wasteful number, since it uses less digits than its factorization.
41001410122100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410014101235 (or 410014101228 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 41001410122100 its reverse (122101410014), we get a palindrome (41123511532114).
The spelling of 41001410122100 in words is "forty-one trillion, one billion, four hundred ten million, one hundred twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •