Base | Representation |
---|---|
bin | 1010001100101001000111… |
… | …1001000100101011000111 |
3 | 1110200212221022201000112111 |
4 | 2203022101321010223013 |
5 | 2432200303422101411 |
6 | 35502510513001451 |
7 | 2235030360023350 |
oct | 243122171045307 |
9 | 43625838630474 |
10 | 11212312300231 |
11 | 3633129a97549 |
12 | 1311030853287 |
13 | 6344164c1383 |
14 | 2aa97092ad27 |
15 | 1469d09dc721 |
hex | a3291e44ac7 |
11212312300231 has 4 divisors (see below), whose sum is σ = 12814071200272. Its totient is φ = 9610553400192.
The previous prime is 11212312300187. The next prime is 11212312300283. The reversal of 11212312300231 is 13200321321211.
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 11212312300231 - 241 = 9013289044679 is a prime.
It is a super-2 number, since 2×112123123002312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11212312300331) 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, 800879450010 + ... + 800879450023.
It is an arithmetic number, because the mean of its divisors is an integer number (3203517800068).
Almost surely, 211212312300231 is an apocalyptic number.
11212312300231 is a deficient number, since it is larger than the sum of its proper divisors (1601758900041).
11212312300231 is an equidigital number, since it uses as much as digits as its factorization.
11212312300231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1601758900040.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11212312300231 its reverse (13200321321211), we get a palindrome (24412633621442).
The spelling of 11212312300231 in words is "eleven trillion, two hundred twelve billion, three hundred twelve million, three hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •