Base | Representation |
---|---|
bin | 11000101000100… |
… | …001011000000000 |
3 | 1001210122120121111 |
4 | 120220201120000 |
5 | 1321244310043 |
6 | 105001533104 |
7 | 13145533162 |
oct | 3050413000 |
9 | 1053576544 |
10 | 413275648 |
11 | 1a2313125 |
12 | b64a4194 |
13 | 6780c106 |
14 | 3cc5c932 |
15 | 2643709d |
hex | 18a21600 |
413275648 has 40 divisors (see below), whose sum is σ = 839801160. Its totient is φ = 203120640.
The previous prime is 413275637. The next prime is 413275651. The reversal of 413275648 is 846572314.
It is a super-2 number, since 2×4132756482 = 341593522459639808, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 413275648.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23368 + ... + 37048.
It is an arithmetic number, because the mean of its divisors is an integer number (20995029).
Almost surely, 2413275648 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 413275648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (419900580).
413275648 is an abundant number, since it is smaller than the sum of its proper divisors (426525512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
413275648 is an equidigital number, since it uses as much as digits as its factorization.
413275648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13758 (or 13742 counting only the distinct ones).
The product of its digits is 161280, while the sum is 40.
The square root of 413275648 is about 20329.1821773528. The cubic root of 413275648 is about 744.8690657694.
The spelling of 413275648 in words is "four hundred thirteen million, two hundred seventy-five thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •