Base | Representation |
---|---|
bin | 10100101110111100… |
… | …01101000101111001 |
3 | 1001201202100011110210 |
4 | 22113132031011321 |
5 | 140244042242103 |
6 | 5040312301333 |
7 | 542561512365 |
oct | 122736150571 |
9 | 31652304423 |
10 | 11131212153 |
11 | 47a2308496 |
12 | 21a79a1849 |
13 | 1085178a89 |
14 | 7784a82a5 |
15 | 45235be03 |
hex | 29778d179 |
11131212153 has 4 divisors (see below), whose sum is σ = 14841616208. Its totient is φ = 7420808100.
The previous prime is 11131212137. The next prime is 11131212193. The reversal of 11131212153 is 35121213111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 35121213111 = 3 ⋅11707071037.
It is not a de Polignac number, because 11131212153 - 24 = 11131212137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11131212193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1855202023 + ... + 1855202028.
It is an arithmetic number, because the mean of its divisors is an integer number (3710404052).
Almost surely, 211131212153 is an apocalyptic number.
It is an amenable number.
11131212153 is a deficient number, since it is larger than the sum of its proper divisors (3710404055).
11131212153 is an equidigital number, since it uses as much as digits as its factorization.
11131212153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3710404054.
The product of its digits is 180, while the sum is 21.
Adding to 11131212153 its reverse (35121213111), we get a palindrome (46252425264).
The spelling of 11131212153 in words is "eleven billion, one hundred thirty-one million, two hundred twelve thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •