Base | Representation |
---|---|
bin | 10111111010011… |
… | …000000111000000 |
3 | 1000221220000020011 |
4 | 113322120013000 |
5 | 1310200212242 |
6 | 103450354304 |
7 | 12640652200 |
oct | 2772300700 |
9 | 1027800204 |
10 | 401179072 |
11 | 196500858 |
12 | b242b994 |
13 | 65165188 |
14 | 3b3d0400 |
15 | 25347d17 |
hex | 17e981c0 |
401179072 has 84 divisors (see below), whose sum is σ = 974948520. Its totient is φ = 162860544.
The previous prime is 401179063. The next prime is 401179081. The reversal of 401179072 is 270971104.
It is an interprime number because it is at equal distance from previous prime (401179063) and next prime (401179081).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 56218 + ... + 62950.
It is an arithmetic number, because the mean of its divisors is an integer number (11606530).
Almost surely, 2401179072 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 401179072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (487474260).
401179072 is an abundant number, since it is smaller than the sum of its proper divisors (573769448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
401179072 is a wasteful number, since it uses less digits than its factorization.
401179072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6778 (or 6761 counting only the distinct ones).
The product of its (nonzero) digits is 3528, while the sum is 31.
The square root of 401179072 is about 20029.4551099125. The cubic root of 401179072 is about 737.5295459579.
The spelling of 401179072 in words is "four hundred one million, one hundred seventy-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •