Base | Representation |
---|---|
bin | 11000011000000… |
… | …100000010000000 |
3 | 1001111112101020100 |
4 | 120120010002000 |
5 | 1314143224102 |
6 | 104325242400 |
7 | 13064053365 |
oct | 3030040200 |
9 | 1044471210 |
10 | 408961152 |
11 | 19a936626 |
12 | b4b63400 |
13 | 6695b362 |
14 | 3c45846c |
15 | 25d83a1c |
hex | 18604080 |
408961152 has 96 divisors (see below), whose sum is σ = 1185125760. Its totient is φ = 135360000.
The previous prime is 408961151. The next prime is 408961159. The reversal of 408961152 is 251169804.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (408961151) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 172777 + ... + 175127.
It is an arithmetic number, because the mean of its divisors is an integer number (12345060).
Almost surely, 2408961152 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 408961152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (592562880).
408961152 is an abundant number, since it is smaller than the sum of its proper divisors (776164608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
408961152 is a wasteful number, since it uses less digits than its factorization.
408961152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2522 (or 2507 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The square root of 408961152 is about 20222.7879383630. The cubic root of 408961152 is about 742.2679096395.
The spelling of 408961152 in words is "four hundred eight million, nine hundred sixty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •