Base | Representation |
---|---|
bin | 10010101111010111110011… |
… | …01001000001110101000000 |
3 | 12101220122111001001220220102 |
4 | 21113223321221001311000 |
5 | 20400141243224120000 |
6 | 223351354411501532 |
7 | 11452221543540533 |
oct | 1127537151016500 |
9 | 171818431056812 |
10 | 41210104520000 |
11 | 1214911a724639 |
12 | 47569647578a8 |
13 | 19cc133406890 |
14 | a268189b2a1a |
15 | 4b6e81a5e3d5 |
hex | 257af9a41d40 |
41210104520000 has 140 divisors (see below), whose sum is σ = 110048257000836. Its totient is φ = 15216038400000.
The previous prime is 41210104519999. The next prime is 41210104520017. The reversal of 41210104520000 is 2540101214.
It is a happy number.
It can be written as a sum of positive squares in 10 ways, for example, as 28808381614336 + 12401722905664 = 5367344^2 + 3521608^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 39105101 + ... + 40145100.
Almost surely, 241210104520000 is an apocalyptic number.
41210104520000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41210104520000 is an abundant number, since it is smaller than the sum of its proper divisors (68838152480836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41210104520000 is an equidigital number, since it uses as much as digits as its factorization.
41210104520000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79250246 (or 79250221 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 20.
Adding to 41210104520000 its reverse (2540101214), we get a palindrome (41212644621214).
The spelling of 41210104520000 in words is "forty-one trillion, two hundred ten billion, one hundred four million, five hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •