Base | Representation |
---|---|
bin | 1010001001000001110110… |
… | …0101101110111010001111 |
3 | 1110110221200210210012012210 |
4 | 2202100131211232322033 |
5 | 2430141133232444101 |
6 | 35414202354401503 |
7 | 2230402063135446 |
oct | 242203545567217 |
9 | 43427623705183 |
10 | 11150231531151 |
11 | 3609872016919 |
12 | 1300ba5b90293 |
13 | 62b60194a69b |
14 | 2a7961995d5d |
15 | 14509a7707d6 |
hex | a241d96ee8f |
11150231531151 has 16 divisors (see below), whose sum is σ = 15072841451360. Its totient is φ = 7330584499200.
The previous prime is 11150231531093. The next prime is 11150231531171. The reversal of 11150231531151 is 15113513205111.
It is not a de Polignac number, because 11150231531151 - 215 = 11150231498383 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 (11150231531171) 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 15 ways as a sum of consecutive naturals, for example, 2232250 + ... + 5223351.
It is an arithmetic number, because the mean of its divisors is an integer number (942052590710).
Almost surely, 211150231531151 is an apocalyptic number.
11150231531151 is a deficient number, since it is larger than the sum of its proper divisors (3922609920209).
11150231531151 is an equidigital number, since it uses as much as digits as its factorization.
11150231531151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7462506.
The product of its (nonzero) digits is 2250, while the sum is 30.
Adding to 11150231531151 its reverse (15113513205111), we get a palindrome (26263744736262).
The spelling of 11150231531151 in words is "eleven trillion, one hundred fifty billion, two hundred thirty-one million, five hundred thirty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •