Base | Representation |
---|---|
bin | 11000001001100… |
… | …001111101000000 |
3 | 1001020100211110001 |
4 | 120021201331000 |
5 | 1312204322202 |
6 | 104111445344 |
7 | 13016505601 |
oct | 3011417500 |
9 | 1036324401 |
10 | 405151552 |
11 | 1987743a3 |
12 | b3826854 |
13 | 65c26360 |
14 | 3bb45da8 |
15 | 2587ed87 |
hex | 18261f40 |
405151552 has 56 divisors (see below), whose sum is σ = 876397536. Its totient is φ = 184708608.
The previous prime is 405151511. The next prime is 405151567. The reversal of 405151552 is 255151504.
It is a self number, because there is not a number n which added to its sum of digits gives 405151552.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66123 + ... + 71989.
It is an arithmetic number, because the mean of its divisors is an integer number (15649956).
Almost surely, 2405151552 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 405151552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (438198768).
405151552 is an abundant number, since it is smaller than the sum of its proper divisors (471245984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
405151552 is a wasteful number, since it uses less digits than its factorization.
405151552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5975 (or 5965 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 28.
The square root of 405151552 is about 20128.3767850267. The cubic root of 405151552 is about 739.9558970550.
The spelling of 405151552 in words is "four hundred five million, one hundred fifty-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •