Base | Representation |
---|---|
bin | 10111111011101… |
… | …010011110000111 |
3 | 1000222112010222122 |
4 | 113323222132013 |
5 | 1310242011143 |
6 | 103501520155 |
7 | 12643555550 |
oct | 2773523607 |
9 | 1028463878 |
10 | 401516423 |
11 | 196711260 |
12 | b257305b |
13 | 652528a9 |
14 | 3b47b327 |
15 | 253b2c68 |
hex | 17eea787 |
401516423 has 8 divisors (see below), whose sum is σ = 500592000. Its totient is φ = 312869880.
The previous prime is 401516419. The next prime is 401516429. The reversal of 401516423 is 324615104.
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 401516423 - 22 = 401516419 is a prime.
It is a super-2 number, since 2×4015164232 = 322430875877429858, 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 = 401516392 and 401516401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401516429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2607173 + ... + 2607326.
It is an arithmetic number, because the mean of its divisors is an integer number (62574000).
Almost surely, 2401516423 is an apocalyptic number.
401516423 is a deficient number, since it is larger than the sum of its proper divisors (99075577).
401516423 is a wasteful number, since it uses less digits than its factorization.
401516423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5214517.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 401516423 is about 20037.8747126535. The cubic root of 401516423 is about 737.7362172754.
The spelling of 401516423 in words is "four hundred one million, five hundred sixteen thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •