Base | Representation |
---|---|
bin | 10101011111110110… |
… | …00110011011111101 |
3 | 1002210100020220122010 |
4 | 22233323012123331 |
5 | 142114102042003 |
6 | 5145125041433 |
7 | 556002423600 |
oct | 125773063375 |
9 | 32710226563 |
10 | 11541440253 |
11 | 4992929982 |
12 | 22a1256279 |
13 | 111c15b9b5 |
14 | 7b6b72337 |
15 | 478391003 |
hex | 2afec66fd |
11541440253 has 24 divisors (see below), whose sum is σ = 17912515392. Its totient is φ = 6590869824.
The previous prime is 11541440249. The next prime is 11541440269. The reversal of 11541440253 is 35204414511.
It is not a de Polignac number, because 11541440253 - 22 = 11541440249 is a prime.
It is a super-2 number, since 2×115414402532 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11541440253.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11541440453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 211801 + ... + 260657.
It is an arithmetic number, because the mean of its divisors is an integer number (746354808).
Almost surely, 211541440253 is an apocalyptic number.
It is an amenable number.
11541440253 is a deficient number, since it is larger than the sum of its proper divisors (6371075139).
11541440253 is a wasteful number, since it uses less digits than its factorization.
11541440253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50481 (or 50474 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 11541440253 its reverse (35204414511), we get a palindrome (46745854764).
The spelling of 11541440253 in words is "eleven billion, five hundred forty-one million, four hundred forty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •