Base | Representation |
---|---|
bin | 10111111011110… |
… | …100010101110100 |
3 | 1000222121012110000 |
4 | 113323310111310 |
5 | 1310244304402 |
6 | 103502431300 |
7 | 12644114454 |
oct | 2773642564 |
9 | 1028535400 |
10 | 401556852 |
11 | 196739674 |
12 | b2592530 |
13 | 65268108 |
14 | 3b48bd64 |
15 | 253bec1c |
hex | 17ef4574 |
401556852 has 60 divisors (see below), whose sum is σ = 1085972580. Its totient is φ = 129233664.
The previous prime is 401556821. The next prime is 401556853. The reversal of 401556852 is 258655104.
401556852 is a `hidden beast` number, since 40 + 1 + 5 + 568 + 52 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 252619236 + 148937616 = 15894^2 + 12204^2 .
It is a super-2 number, since 2×4015568522 = 322495810776299808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401556853) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 11973 + ... + 30764.
It is an arithmetic number, because the mean of its divisors is an integer number (18099543).
Almost surely, 2401556852 is an apocalyptic number.
It is an amenable number.
401556852 is an abundant number, since it is smaller than the sum of its proper divisors (684415728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401556852 is a wasteful number, since it uses less digits than its factorization.
401556852 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42782 (or 42771 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 36.
The square root of 401556852 is about 20038.8835018321. The cubic root of 401556852 is about 737.7609775217.
The spelling of 401556852 in words is "four hundred one million, five hundred fifty-six thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •