Base | Representation |
---|---|
bin | 10111111011100… |
… | …111111011110101 |
3 | 1000222111121201222 |
4 | 113323213323311 |
5 | 1310241143122 |
6 | 103501400125 |
7 | 12643513352 |
oct | 2773477365 |
9 | 1028447658 |
10 | 401506037 |
11 | 196704479 |
12 | b2569045 |
13 | 6524ac4a |
14 | 3b477629 |
15 | 253aeb42 |
hex | 17ee7ef5 |
401506037 has 8 divisors (see below), whose sum is σ = 404915736. Its totient is φ = 398103552.
The previous prime is 401506031. The next prime is 401506069. The reversal of 401506037 is 730605104.
It can be written as a sum of positive squares in 4 ways, for example, as 262407601 + 139098436 = 16199^2 + 11794^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 401506037 - 214 = 401489653 is a prime.
It is a super-2 number, since 2×4015060372 = 322414195494890738, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 401505997 and 401506015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401506031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 198053 + ... + 200069.
It is an arithmetic number, because the mean of its divisors is an integer number (50614467).
Almost surely, 2401506037 is an apocalyptic number.
It is an amenable number.
401506037 is a deficient number, since it is larger than the sum of its proper divisors (3409699).
401506037 is a wasteful number, since it uses less digits than its factorization.
401506037 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3607.
The product of its (nonzero) digits is 2520, while the sum is 26.
The square root of 401506037 is about 20037.6155517567. The cubic root of 401506037 is about 737.7298562285.
The spelling of 401506037 in words is "four hundred one million, five hundred six thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •