Base | Representation |
---|---|
bin | 10111111010100… |
… | …110001010110101 |
3 | 1000221222221020002 |
4 | 113322212022311 |
5 | 1310204033121 |
6 | 103451521045 |
7 | 12641312120 |
oct | 2772461265 |
9 | 1027887202 |
10 | 401236661 |
11 | 196540051 |
12 | b2459185 |
13 | 65185457 |
14 | 3b4073b7 |
15 | 25359e0b |
hex | 17ea62b5 |
401236661 has 8 divisors (see below), whose sum is σ = 482690880. Its totient is φ = 325816128.
The previous prime is 401236643. The next prime is 401236673. The reversal of 401236661 is 166632104.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-401236661 is a prime.
It is a super-3 number, since 3×4012366613 (a number of 27 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401236681) 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, 1508276 + ... + 1508541.
It is an arithmetic number, because the mean of its divisors is an integer number (60336360).
Almost surely, 2401236661 is an apocalyptic number.
It is an amenable number.
401236661 is a deficient number, since it is larger than the sum of its proper divisors (81454219).
401236661 is a wasteful number, since it uses less digits than its factorization.
401236661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3016843.
The product of its (nonzero) digits is 5184, while the sum is 29.
The square root of 401236661 is about 20030.8926660796. The cubic root of 401236661 is about 737.5648349014.
Adding to 401236661 its reverse (166632104), we get a palindrome (567868765).
The spelling of 401236661 in words is "four hundred one million, two hundred thirty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •