Base | Representation |
---|---|
bin | 1011111100101011010… |
… | …11100111001100100000 |
3 | 1110020122202111212102021 |
4 | 11332111223213030200 |
5 | 23211232440143130 |
6 | 512332445431224 |
7 | 41442252015604 |
oct | 5762553471440 |
9 | 1406582455367 |
10 | 410533131040 |
11 | 14911928267a |
12 | 6769286b514 |
13 | 2c936910a66 |
14 | 15c27063504 |
15 | aa2b4b637a |
hex | 5f95ae7320 |
410533131040 has 48 divisors (see below), whose sum is σ = 979883368632. Its totient is φ = 162520326144.
The previous prime is 410533130977. The next prime is 410533131059. The reversal of 410533131040 is 40131335014.
It can be written as a sum of positive squares in 4 ways, for example, as 170625172624 + 239907958416 = 413068^2 + 489804^2 .
It is a super-2 number, since 2×4105331310402 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 410533130996 and 410533131014.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13210419 + ... + 13241458.
Almost surely, 2410533131040 is an apocalyptic number.
410533131040 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
410533131040 is an abundant number, since it is smaller than the sum of its proper divisors (569350237592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
410533131040 is a wasteful number, since it uses less digits than its factorization.
410533131040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26451989 (or 26451981 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 410533131040 its reverse (40131335014), we get a palindrome (450664466054).
The spelling of 410533131040 in words is "four hundred ten billion, five hundred thirty-three million, one hundred thirty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •