Base | Representation |
---|---|
bin | 10111111010010… |
… | …111100001101001 |
3 | 1000221212212221121 |
4 | 113322113201221 |
5 | 1310200123211 |
6 | 103450335241 |
7 | 12640642213 |
oct | 2772274151 |
9 | 1027785847 |
10 | 401176681 |
11 | 1964a9a84 |
12 | b242a521 |
13 | 65164069 |
14 | 3b3cd5b3 |
15 | 25347271 |
hex | 17e97869 |
401176681 has 8 divisors (see below), whose sum is σ = 412270664. Its totient is φ = 390096000.
The previous prime is 401176679. The next prime is 401176709. The reversal of 401176681 is 186671104.
It can be written as a sum of positive squares in 4 ways, for example, as 26173456 + 375003225 = 5116^2 + 19365^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 401176681 - 21 = 401176679 is a prime.
It is a super-2 number, since 2×4011766812 = 321885458756351522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (401176481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 109231 + ... + 112843.
It is an arithmetic number, because the mean of its divisors is an integer number (51533833).
Almost surely, 2401176681 is an apocalyptic number.
It is an amenable number.
401176681 is a deficient number, since it is larger than the sum of its proper divisors (11093983).
401176681 is a wasteful number, since it uses less digits than its factorization.
401176681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6651.
The product of its (nonzero) digits is 8064, while the sum is 34.
The square root of 401176681 is about 20029.3954227281. The cubic root of 401176681 is about 737.5280807464.
The spelling of 401176681 in words is "four hundred one million, one hundred seventy-six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •