Base | Representation |
---|---|
bin | 10111111011001… |
… | …110110010001111 |
3 | 1000222022101102122 |
4 | 113323032302033 |
5 | 1310224344043 |
6 | 103455243155 |
7 | 12642604130 |
oct | 2773166217 |
9 | 1028271378 |
10 | 401403023 |
11 | 19664403a |
12 | b25194bb |
13 | 652130a8 |
14 | 3b44bc87 |
15 | 2538e368 |
hex | 17ecec8f |
401403023 has 16 divisors (see below), whose sum is σ = 465513216. Its totient is φ = 339007680.
The previous prime is 401403017. The next prime is 401403043. The reversal of 401403023 is 320304104.
It is a cyclic number.
It is not a de Polignac number, because 401403023 - 218 = 401140879 is a prime.
It is a super-2 number, since 2×4014030232 = 322248773747077058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 401402992 and 401403010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401403043) 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 15 ways as a sum of consecutive naturals, for example, 303203 + ... + 304523.
It is an arithmetic number, because the mean of its divisors is an integer number (29094576).
Almost surely, 2401403023 is an apocalyptic number.
401403023 is a deficient number, since it is larger than the sum of its proper divisors (64110193).
401403023 is a wasteful number, since it uses less digits than its factorization.
401403023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1934.
The product of its (nonzero) digits is 288, while the sum is 17.
The square root of 401403023 is about 20035.0448714247. The cubic root of 401403023 is about 737.6667579628. Note that the first 3 decimals are identical.
Adding to 401403023 its reverse (320304104), we get a palindrome (721707127).
The spelling of 401403023 in words is "four hundred one million, four hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •