Base | Representation |
---|---|
bin | 1010001001001000101001… |
… | …0010100110001011111111 |
3 | 1110111010101220101202102012 |
4 | 2202102022102212023333 |
5 | 2430203402114344411 |
6 | 35415103342521435 |
7 | 2230465216262345 |
oct | 242221222461377 |
9 | 43433356352365 |
10 | 11152055231231 |
11 | 360a618498772 |
12 | 130141489627b |
13 | 62b832718065 |
14 | 2a7a95c7b995 |
15 | 14515590b18b |
hex | a248a4a62ff |
11152055231231 has 4 divisors (see below), whose sum is σ = 11152199245200. Its totient is φ = 11151911217264.
The previous prime is 11152055231197. The next prime is 11152055231257. The reversal of 11152055231231 is 13213255025111.
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 11152055231231 - 238 = 10877177324287 is a prime.
It is a super-2 number, since 2×111520552312312 (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 (11152055231281) 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, 71890766 + ... + 72045723.
It is an arithmetic number, because the mean of its divisors is an integer number (2788049811300).
Almost surely, 211152055231231 is an apocalyptic number.
11152055231231 is a deficient number, since it is larger than the sum of its proper divisors (144013969).
11152055231231 is an equidigital number, since it uses as much as digits as its factorization.
11152055231231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144013968.
The product of its (nonzero) digits is 9000, while the sum is 32.
It can be divided in two parts, 1115205 and 5231231, that added together give a palindrome (6346436).
The spelling of 11152055231231 in words is "eleven trillion, one hundred fifty-two billion, fifty-five million, two hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •