Base | Representation |
---|---|
bin | 1011101010111111110… |
… | …00001010000010011111 |
3 | 1102100011012111000112222 |
4 | 11311133320022002133 |
5 | 23032312332441411 |
6 | 504122510015555 |
7 | 40655105064056 |
oct | 5653770120237 |
9 | 1370135430488 |
10 | 401040515231 |
11 | 145097a08944 |
12 | 658837a75bb |
13 | 2ba83092725 |
14 | 155a645939d |
15 | a672e2e4db |
hex | 5d5fe0a09f |
401040515231 has 8 divisors (see below), whose sum is σ = 430611855264. Its totient is φ = 372133699840.
The previous prime is 401040515209. The next prime is 401040515233. The reversal of 401040515231 is 132515040104.
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 401040515231 - 210 = 401040514207 is a prime.
It is a super-2 number, since 2×4010405152312 (a number of 24 digits) 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 401040515231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401040515233) 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, 166129910 + ... + 166132323.
It is an arithmetic number, because the mean of its divisors is an integer number (53826481908).
Almost surely, 2401040515231 is an apocalyptic number.
401040515231 is a deficient number, since it is larger than the sum of its proper divisors (29571340033).
401040515231 is a wasteful number, since it uses less digits than its factorization.
401040515231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 332262321.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 401040515231 its reverse (132515040104), we get a palindrome (533555555335).
The spelling of 401040515231 in words is "four hundred one billion, forty million, five hundred fifteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •