Base | Representation |
---|---|
bin | 1010000110111011110001… |
… | …1110001011001100010101 |
3 | 1110100111210122220222221122 |
4 | 2201232330132023030111 |
5 | 2424043432024442100 |
6 | 35345451255053325 |
7 | 2224656200556545 |
oct | 241567436131425 |
9 | 43314718828848 |
10 | 11114242421525 |
11 | 35a5584110111 |
12 | 12b6021371245 |
13 | 6280b7830749 |
14 | 2a5d09d75325 |
15 | 144190e60985 |
hex | a1bbc78b315 |
11114242421525 has 24 divisors (see below), whose sum is σ = 13788563261184. Its totient is φ = 8886941888000.
The previous prime is 11114242421521. The next prime is 11114242421551. The reversal of 11114242421525 is 52512424241111.
It is not a de Polignac number, because 11114242421525 - 22 = 11114242421521 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11114242421521) 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, 479029925 + ... + 479053125.
It is an arithmetic number, because the mean of its divisors is an integer number (574523469216).
Almost surely, 211114242421525 is an apocalyptic number.
It is an amenable number.
11114242421525 is a deficient number, since it is larger than the sum of its proper divisors (2674320839659).
11114242421525 is a wasteful number, since it uses less digits than its factorization.
11114242421525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31981 (or 31976 counting only the distinct ones).
The product of its digits is 25600, while the sum is 35.
Adding to 11114242421525 its reverse (52512424241111), we get a palindrome (63626666662636).
The spelling of 11114242421525 in words is "eleven trillion, one hundred fourteen billion, two hundred forty-two million, four hundred twenty-one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •