Base | Representation |
---|---|
bin | 10111111100010… |
… | …100101000100101 |
3 | 1000222211220220000 |
4 | 113330110220211 |
5 | 1310313023000 |
6 | 103505331513 |
7 | 12645205215 |
oct | 2774245045 |
9 | 1028756800 |
10 | 401689125 |
11 | 196819a92 |
12 | b2636b99 |
13 | 652b3396 |
14 | 3b4c4245 |
15 | 253e9000 |
hex | 17f14a25 |
401689125 has 80 divisors (see below), whose sum is σ = 758437680. Its totient is φ = 211507200.
The previous prime is 401689097. The next prime is 401689133. The reversal of 401689125 is 521986104.
It can be written as a sum of positive squares in 8 ways, for example, as 57289761 + 344399364 = 7569^2 + 18558^2 .
It is not a de Polignac number, because 401689125 - 26 = 401689061 is a prime.
It is a super-2 number, since 2×4016891252 = 322708306286531250, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 401689125.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 981921 + ... + 982329.
It is an arithmetic number, because the mean of its divisors is an integer number (9480471).
Almost surely, 2401689125 is an apocalyptic number.
401689125 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
401689125 is a deficient number, since it is larger than the sum of its proper divisors (356748555).
401689125 is an equidigital number, since it uses as much as digits as its factorization.
401689125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 533 (or 514 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The square root of 401689125 is about 20042.1836385160. The cubic root of 401689125 is about 737.8419748901.
The spelling of 401689125 in words is "four hundred one million, six hundred eighty-nine thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •