Base | Representation |
---|---|
bin | 1011111001110001000… |
… | …10100101000110010000 |
3 | 1110002121212010002000021 |
4 | 11330320202211012100 |
5 | 23200032420411224 |
6 | 511513424433224 |
7 | 41355445511644 |
oct | 5747042450620 |
9 | 1402555102007 |
10 | 408970482064 |
11 | 1484971a2341 |
12 | 67317478814 |
13 | 2c747c54bb1 |
14 | 15b196d2c24 |
15 | a9891e41e4 |
hex | 5f388a5190 |
408970482064 has 135 divisors (see below), whose sum is σ = 849123586857. Its totient is φ = 190808722944.
The previous prime is 408970482059. The next prime is 408970482071. The reversal of 408970482064 is 460284079804.
The square root of 408970482064 is 639508.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 186744979600 + 222225502464 = 432140^2 + 471408^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 2744768262 + ... + 2744768410.
Almost surely, 2408970482064 is an apocalyptic number.
408970482064 is the 639508-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 408970482064
408970482064 is an abundant number, since it is smaller than the sum of its proper divisors (440153104793).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
408970482064 is an equidigital number, since it uses as much as digits as its factorization.
408970482064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438 (or 217 counting only the distinct ones).
The product of its (nonzero) digits is 3096576, while the sum is 52.
The spelling of 408970482064 in words is "four hundred eight billion, nine hundred seventy million, four hundred eighty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •