Base | Representation |
---|---|
bin | 1011111101101001010… |
… | …11101001100000011010 |
3 | 1110022000000011211211100 |
4 | 11332310223221200122 |
5 | 23213314111443302 |
6 | 512500225212230 |
7 | 41461165561422 |
oct | 5766453514032 |
9 | 1408000154740 |
10 | 411053234202 |
11 | 14936591a8a6 |
12 | 677b8a91076 |
13 | 2c9ba5b4200 |
14 | 15c7616d482 |
15 | aa5bea0d1c |
hex | 5fb4ae981a |
411053234202 has 144 divisors (see below), whose sum is σ = 977837971968. Its totient is φ = 124724995200.
The previous prime is 411053234159. The next prime is 411053234203. The reversal of 411053234202 is 202432350114.
It is a super-2 number, since 2×4110532342022 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (411053234203) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 80802103 + ... + 80807189.
It is an arithmetic number, because the mean of its divisors is an integer number (6790541472).
Almost surely, 2411053234202 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 411053234202, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (488918985984).
411053234202 is an abundant number, since it is smaller than the sum of its proper divisors (566784737766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
411053234202 is a wasteful number, since it uses less digits than its factorization.
411053234202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5485 (or 5469 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 411053234202 its reverse (202432350114), we get a palindrome (613485584316).
The spelling of 411053234202 in words is "four hundred eleven billion, fifty-three million, two hundred thirty-four thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •