Base | Representation |
---|---|
bin | 100110001011111010… |
… | …100111010110010010 |
3 | 10220211111200201001020 |
4 | 212023322213112102 |
5 | 1132433014313320 |
6 | 30500333220310 |
7 | 2651033064264 |
oct | 461372472622 |
9 | 126744621036 |
10 | 41002104210 |
11 | 16430689841 |
12 | 7b43631696 |
13 | 3b35878432 |
14 | 1dad705b34 |
15 | 10ee981940 |
hex | 98bea7592 |
41002104210 has 64 divisors (see below), whose sum is σ = 98948649600. Its totient is φ = 10873608192.
The previous prime is 41002104203. The next prime is 41002104217. The reversal of 41002104210 is 1240120014.
It is an interprime number because it is at equal distance from previous prime (41002104203) and next prime (41002104217).
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 41002104210.
It is not an unprimeable number, because it can be changed into a prime (41002104217) 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 31 ways as a sum of consecutive naturals, for example, 6997602 + ... + 7003458.
It is an arithmetic number, because the mean of its divisors is an integer number (1546072650).
Almost surely, 241002104210 is an apocalyptic number.
41002104210 is an abundant number, since it is smaller than the sum of its proper divisors (57946545390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41002104210 is a wasteful number, since it uses less digits than its factorization.
41002104210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7115.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 41002104210 its reverse (1240120014), we get a palindrome (42242224224).
The spelling of 41002104210 in words is "forty-one billion, two million, one hundred four thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •