Base | Representation |
---|---|
bin | 1010001001010001000100… |
… | …0101000101011110011011 |
3 | 1110111100020111120212202012 |
4 | 2202110101011011132123 |
5 | 2430223020023113111 |
6 | 35420120004100135 |
7 | 2230605235563560 |
oct | 242242105053633 |
9 | 43440214525665 |
10 | 11154316613531 |
11 | 3610578a32763 |
12 | 130194609464b |
13 | 62bb0308b8b0 |
14 | 2a7c2c336867 |
15 | 14523920048b |
hex | a251114579b |
11154316613531 has 24 divisors (see below), whose sum is σ = 14488965326304. Its totient is φ = 8360898952320.
The previous prime is 11154316613519. The next prime is 11154316613533. The reversal of 11154316613531 is 13531661345111.
It is not a de Polignac number, because 11154316613531 - 214 = 11154316597147 is a prime.
It is a super-2 number, since 2×111543166135312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11154316613533) 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 23 ways as a sum of consecutive naturals, for example, 169738490 + ... + 169804191.
It is an arithmetic number, because the mean of its divisors is an integer number (603706888596).
Almost surely, 211154316613531 is an apocalyptic number.
11154316613531 is a deficient number, since it is larger than the sum of its proper divisors (3334648712773).
11154316613531 is a wasteful number, since it uses less digits than its factorization.
11154316613531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339542739 (or 339542720 counting only the distinct ones).
The product of its digits is 97200, while the sum is 41.
Adding to 11154316613531 its reverse (13531661345111), we get a palindrome (24685977958642).
The spelling of 11154316613531 in words is "eleven trillion, one hundred fifty-four billion, three hundred sixteen million, six hundred thirteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •