Base | Representation |
---|---|
bin | 10111111011001… |
… | …110001011001011 |
3 | 1000222022021000001 |
4 | 113323032023023 |
5 | 1310224304043 |
6 | 103455223431 |
7 | 12642563626 |
oct | 2773161313 |
9 | 1028267001 |
10 | 401400523 |
11 | 196642177 |
12 | b2517b77 |
13 | 65211c04 |
14 | 3b44adbd |
15 | 2538d74d |
hex | 17ece2cb |
401400523 has 4 divisors (see below), whose sum is σ = 401442480. Its totient is φ = 401358568.
The previous prime is 401400511. The next prime is 401400553. The reversal of 401400523 is 325004104.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 401400523 - 25 = 401400491 is a prime.
It is a super-2 number, since 2×4014005232 = 322244759729347058, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 401400523.
It is not an unprimeable number, because it can be changed into a prime (401400553) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1161 + ... + 28357.
It is an arithmetic number, because the mean of its divisors is an integer number (100360620).
Almost surely, 2401400523 is an apocalyptic number.
401400523 is a deficient number, since it is larger than the sum of its proper divisors (41957).
401400523 is a wasteful number, since it uses less digits than its factorization.
401400523 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41956.
The product of its (nonzero) digits is 480, while the sum is 19.
The square root of 401400523 is about 20034.9824806512. The cubic root of 401400523 is about 737.6652265255.
Adding to 401400523 its reverse (325004104), we get a palindrome (726404627).
The spelling of 401400523 in words is "four hundred one million, four hundred thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •