Base | Representation |
---|---|
bin | 1010010010011100100110… |
… | …1001111010111110000111 |
3 | 1111001102022222002201122102 |
4 | 2210213021221322332013 |
5 | 2440314020204201411 |
6 | 40020401550222315 |
7 | 2245160462236262 |
oct | 244471151727607 |
9 | 44042288081572 |
10 | 11312032100231 |
11 | 36714512421a5 |
12 | 13284207b499b |
13 | 640948c463a5 |
14 | 2b171068dcd9 |
15 | 1493ba329d3b |
hex | a49c9a7af87 |
11312032100231 has 2 divisors, whose sum is σ = 11312032100232. Its totient is φ = 11312032100230.
The previous prime is 11312032100153. The next prime is 11312032100251. The reversal of 11312032100231 is 13200123021311.
It is a happy number.
It is an a-pointer prime, because the next prime (11312032100251) can be obtained adding 11312032100231 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11312032100231 is a prime.
It is a super-2 number, since 2×113120321002312 (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 (11312032100251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5656016050115 + 5656016050116.
It is an arithmetic number, because the mean of its divisors is an integer number (5656016050116).
Almost surely, 211312032100231 is an apocalyptic number.
11312032100231 is a deficient number, since it is larger than the sum of its proper divisors (1).
11312032100231 is an equidigital number, since it uses as much as digits as its factorization.
11312032100231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11312032100231 its reverse (13200123021311), we get a palindrome (24512155121542).
The spelling of 11312032100231 in words is "eleven trillion, three hundred twelve billion, thirty-two million, one hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •