Base | Representation |
---|---|
bin | 1010010010100001000010… |
… | …0001010010101001000111 |
3 | 1111001112101211021010021111 |
4 | 2210220100201102221013 |
5 | 2440323434040121411 |
6 | 40021115541025451 |
7 | 2245232110006324 |
oct | 244502041225107 |
9 | 44045354233244 |
10 | 11313221020231 |
11 | 3671a01370409 |
12 | 13286b29b5287 |
13 | 640aa835b550 |
14 | 2b17c4537b4b |
15 | 1494398c7721 |
hex | a4a10852a47 |
11313221020231 has 4 divisors (see below), whose sum is σ = 12183468791032. Its totient is φ = 10442973249432.
The previous prime is 11313221020201. The next prime is 11313221020253. The reversal of 11313221020231 is 13202012231311.
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 11313221020231 - 219 = 11313220495943 is a prime.
It is a super-2 number, since 2×113132210202312 (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 (11313221020201) 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, 435123885381 + ... + 435123885406.
It is an arithmetic number, because the mean of its divisors is an integer number (3045867197758).
Almost surely, 211313221020231 is an apocalyptic number.
11313221020231 is a deficient number, since it is larger than the sum of its proper divisors (870247770801).
11313221020231 is an equidigital number, since it uses as much as digits as its factorization.
11313221020231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 870247770800.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11313221020231 its reverse (13202012231311), we get a palindrome (24515233251542).
The spelling of 11313221020231 in words is "eleven trillion, three hundred thirteen billion, two hundred twenty-one million, twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •