Base | Representation |
---|---|
bin | 1010010111100101001000… |
… | …0101010100100011110111 |
3 | 1111100211221221210222120011 |
4 | 2211321102011110203313 |
5 | 2443240122401031411 |
6 | 40125104450121051 |
7 | 2254432041644455 |
oct | 245712205244367 |
9 | 44324857728504 |
10 | 11400220330231 |
11 | 36a589619a707 |
12 | 1341532880187 |
13 | 6490615b71c5 |
14 | 2b5ab8acd9d5 |
15 | 14b82c5c5c21 |
hex | a5e521548f7 |
11400220330231 has 2 divisors, whose sum is σ = 11400220330232. Its totient is φ = 11400220330230.
The previous prime is 11400220330217. The next prime is 11400220330273. The reversal of 11400220330231 is 13203302200411.
11400220330231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11400220330231 - 219 = 11400219805943 is a prime.
It is a super-2 number, since 2×114002203302312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11400220330211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5700110165115 + 5700110165116.
It is an arithmetic number, because the mean of its divisors is an integer number (5700110165116).
Almost surely, 211400220330231 is an apocalyptic number.
11400220330231 is a deficient number, since it is larger than the sum of its proper divisors (1).
11400220330231 is an equidigital number, since it uses as much as digits as its factorization.
11400220330231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 11400220330231 its reverse (13203302200411), we get a palindrome (24603522530642).
The spelling of 11400220330231 in words is "eleven trillion, four hundred billion, two hundred twenty million, three hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •