Base | Representation |
---|---|
bin | 1010011010110111010001… |
… | …1011100010100101101010 |
3 | 1111120020120022201210120021 |
4 | 2212231310123202211222 |
5 | 3000201140033430200 |
6 | 40211034221551054 |
7 | 2261500000023544 |
oct | 246556433424552 |
9 | 44506508653507 |
10 | 11456631155050 |
11 | 3717803682294 |
12 | 135045671548a |
13 | 6514815843a3 |
14 | 2b870aa10694 |
15 | 14d02eba441a |
hex | a6b746e296a |
11456631155050 has 12 divisors (see below), whose sum is σ = 21309333948486. Its totient is φ = 4582652462000.
The previous prime is 11456631155027. The next prime is 11456631155051. The reversal of 11456631155050 is 5055113665411.
It can be written as a sum of positive squares in 3 ways, for example, as 4803579573849 + 6653051581201 = 2191707^2 + 2579351^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11456631154988 and 11456631155006.
It is not an unprimeable number, because it can be changed into a prime (11456631155051) 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 5 ways as a sum of consecutive naturals, for example, 114566311501 + ... + 114566311600.
Almost surely, 211456631155050 is an apocalyptic number.
11456631155050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11456631155050 is a deficient number, since it is larger than the sum of its proper divisors (9852702793436).
11456631155050 is a wasteful number, since it uses less digits than its factorization.
11456631155050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229132623113 (or 229132623108 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 43.
The spelling of 11456631155050 in words is "eleven trillion, four hundred fifty-six billion, six hundred thirty-one million, one hundred fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •