Base | Representation |
---|---|
bin | 1010000011001110010100… |
… | …1100001010001001001011 |
3 | 1110010102021102022002020202 |
4 | 2200303211030022021023 |
5 | 2422022411232230201 |
6 | 35300310300242415 |
7 | 2220241501106063 |
oct | 240634514121113 |
9 | 43112242262222 |
10 | 11050501055051 |
11 | 358054483a047 |
12 | 12a57b254040b |
13 | 622099c28153 |
14 | 2a2bc06543a3 |
15 | 1426b0024c6b |
hex | a0ce530a24b |
11050501055051 has 16 divisors (see below), whose sum is σ = 11441706812160. Its totient is φ = 10659974280480.
The previous prime is 11050501055021. The next prime is 11050501055081. The reversal of 11050501055051 is 15055010505011.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11050501055021) and next prime (11050501055081).
It is a cyclic number.
It is not a de Polignac number, because 11050501055051 - 226 = 11050433946187 is a prime.
It is a super-2 number, since 2×110505010550512 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11050501055021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 502216016 + ... + 502238018.
It is an arithmetic number, because the mean of its divisors is an integer number (715106675760).
Almost surely, 211050501055051 is an apocalyptic number.
11050501055051 is a deficient number, since it is larger than the sum of its proper divisors (391205757109).
11050501055051 is a wasteful number, since it uses less digits than its factorization.
11050501055051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36626.
The product of its (nonzero) digits is 3125, while the sum is 29.
The spelling of 11050501055051 in words is "eleven trillion, fifty billion, five hundred one million, fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •