Base | Representation |
---|---|
bin | 1011111011110010010… |
… | …11110000111011000001 |
3 | 1110012102102212022200022 |
4 | 11331321023300323001 |
5 | 23204243041121400 |
6 | 512213210103225 |
7 | 41424355106534 |
oct | 5757113607301 |
9 | 1405372768608 |
10 | 410055020225 |
11 | 1489a3406974 |
12 | 6757a71ab15 |
13 | 2c88b850c56 |
14 | 15bbd768a1b |
15 | a9ee523b85 |
hex | 5f792f0ec1 |
410055020225 has 12 divisors (see below), whose sum is σ = 508506206124. Its totient is φ = 328019512320.
The previous prime is 410055020201. The next prime is 410055020279. The reversal of 410055020225 is 522020550014.
It can be written as a sum of positive squares in 6 ways, for example, as 2980395649 + 407074624576 = 54593^2 + 638024^2 .
It is not a de Polignac number, because 410055020225 - 236 = 341335543489 is a prime.
It is a super-2 number, since 2×4100550202252 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 410055020194 and 410055020203.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 267404 + ... + 944253.
It is an arithmetic number, because the mean of its divisors is an integer number (42375517177).
Almost surely, 2410055020225 is an apocalyptic number.
It is an amenable number.
410055020225 is a deficient number, since it is larger than the sum of its proper divisors (98451185899).
410055020225 is a wasteful number, since it uses less digits than its factorization.
410055020225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1225204 (or 1225199 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 26.
Adding to 410055020225 its reverse (522020550014), we get a palindrome (932075570239).
The spelling of 410055020225 in words is "four hundred ten billion, fifty-five million, twenty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •