Base | Representation |
---|---|
bin | 101101100000101010010101… |
… | …0000011010110001100101111 |
3 | 1221111101120011111000100100011 |
4 | 1123001110222003112030233 |
5 | 404432212243340002421 |
6 | 3535221151511514051 |
7 | 150214445412635350 |
oct | 13301245203261457 |
9 | 1844346144010304 |
10 | 400313132344111 |
11 | 106608934080448 |
12 | 38a9344a088927 |
13 | 1424a49bca7a7c |
14 | 70bd38a925d27 |
15 | 31430e36824e1 |
hex | 16c152a0d632f |
400313132344111 has 16 divisors (see below), whose sum is σ = 458567694402048. Its totient is φ = 342325555308000.
The previous prime is 400313132344091. The next prime is 400313132344163. The reversal of 400313132344111 is 111443231313004.
It is a cyclic number.
It is not a de Polignac number, because 400313132344111 - 27 = 400313132343983 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400313132344211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9765456 + ... + 29933098.
It is an arithmetic number, because the mean of its divisors is an integer number (28660480900128).
Almost surely, 2400313132344111 is an apocalyptic number.
400313132344111 is a deficient number, since it is larger than the sum of its proper divisors (58254562057937).
400313132344111 is a wasteful number, since it uses less digits than its factorization.
400313132344111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20174262.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 400313132344111 its reverse (111443231313004), we get a palindrome (511756363657115).
The spelling of 400313132344111 in words is "four hundred trillion, three hundred thirteen billion, one hundred thirty-two million, three hundred forty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •