Base | Representation |
---|---|
bin | 10111111011110… |
… | …010100010100000 |
3 | 1000222120211022200 |
4 | 113323302202200 |
5 | 1310244040342 |
6 | 103502333200 |
7 | 12644054112 |
oct | 2773624240 |
9 | 1028524280 |
10 | 401549472 |
11 | 196734075 |
12 | b258a200 |
13 | 6526494c |
14 | 3b4893b2 |
15 | 253bc94c |
hex | 17ef28a0 |
401549472 has 36 divisors (see below), whose sum is σ = 1141907130. Its totient is φ = 133849728.
The previous prime is 401549471. The next prime is 401549497. The reversal of 401549472 is 274945104.
It is a happy number.
401549472 is a `hidden beast` number, since 40 + 1 + 549 + 4 + 72 = 666.
It can be written as a sum of positive squares in only one way, i.e., 304014096 + 97535376 = 17436^2 + 9876^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×4015494722 = 322483956926957568, which contains 22 as substring.
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 (401549471) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 696847 + ... + 697422.
Almost surely, 2401549472 is an apocalyptic number.
It is an amenable number.
401549472 is an abundant number, since it is smaller than the sum of its proper divisors (740357658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401549472 is a wasteful number, since it uses less digits than its factorization.
401549472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1394285 (or 1394274 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The square root of 401549472 is about 20038.6993589903. The cubic root of 401549472 is about 737.7564578550.
The spelling of 401549472 in words is "four hundred one million, five hundred forty-nine thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •