Base | Representation |
---|---|
bin | 1011101011100000010… |
… | …00001000111000000111 |
3 | 1102100212012110210202012 |
4 | 11311300020020320013 |
5 | 23033342130441411 |
6 | 504205525204435 |
7 | 40664625260123 |
oct | 5656010107007 |
9 | 1370765423665 |
10 | 401313140231 |
11 | 145217895063 |
12 | 6593ab6071b |
13 | 2bac76c72b3 |
14 | 155d0744583 |
15 | a68bd3218b |
hex | 5d70208e07 |
401313140231 has 4 divisors (see below), whose sum is σ = 402150955200. Its totient is φ = 400475325264.
The previous prime is 401313140227. The next prime is 401313140243. The reversal of 401313140231 is 132041313104.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 401313140231 - 22 = 401313140227 is a prime.
It is a super-2 number, since 2×4013131402312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 401313140197 and 401313140206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401313146231) 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, 418906766 + ... + 418907723.
It is an arithmetic number, because the mean of its divisors is an integer number (100537738800).
Almost surely, 2401313140231 is an apocalyptic number.
401313140231 is a deficient number, since it is larger than the sum of its proper divisors (837814969).
401313140231 is an equidigital number, since it uses as much as digits as its factorization.
401313140231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 837814968.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 401313140231 its reverse (132041313104), we get a palindrome (533354453335).
The spelling of 401313140231 in words is "four hundred one billion, three hundred thirteen million, one hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •