Base | Representation |
---|---|
bin | 1010011111101110000011… |
… | …1000101110000010001111 |
3 | 1111212012220021122102022022 |
4 | 2213323200320232002033 |
5 | 3003033013102401223 |
6 | 40313232251040355 |
7 | 2300512216033346 |
oct | 247734070560217 |
9 | 44765807572268 |
10 | 11540055122063 |
11 | 374a1232a4476 |
12 | 13646591400bb |
13 | 6592b7b83c90 |
14 | 2bc7823d4b5d |
15 | 1502b3a61ac8 |
hex | a7ee0e2e08f |
11540055122063 has 8 divisors (see below), whose sum is σ = 12446217877968. Its totient is φ = 10636530395904.
The previous prime is 11540055122059. The next prime is 11540055122083. The reversal of 11540055122063 is 36022155004511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11540055122063 - 22 = 11540055122059 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 (11540055122023) 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 7 ways as a sum of consecutive naturals, for example, 659498345 + ... + 659515842.
It is an arithmetic number, because the mean of its divisors is an integer number (1555777234746).
Almost surely, 211540055122063 is an apocalyptic number.
11540055122063 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11540055122063 is a deficient number, since it is larger than the sum of its proper divisors (906162755905).
11540055122063 is a wasteful number, since it uses less digits than its factorization.
11540055122063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1319014873.
The product of its (nonzero) digits is 36000, while the sum is 35.
The spelling of 11540055122063 in words is "eleven trillion, five hundred forty billion, fifty-five million, one hundred twenty-two thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •