Base | Representation |
---|---|
bin | 1010001001000001001101… |
… | …1001111001001110001101 |
3 | 1110110221020220020210220000 |
4 | 2202100103121321032031 |
5 | 2430140311011434001 |
6 | 35414133412114513 |
7 | 2230364616541635 |
oct | 242202331711615 |
9 | 43427226223800 |
10 | 11150060655501 |
11 | 3609794616479 |
12 | 1300b58905a39 |
13 | 62b5a541c931 |
14 | 2a7946dd56c5 |
15 | 14508a76aa86 |
hex | a241367938d |
11150060655501 has 20 divisors (see below), whose sum is σ = 16768050469500. Its totient is φ = 7383485347776.
The previous prime is 11150060655491. The next prime is 11150060655509. The reversal of 11150060655501 is 10555606005111.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 540480810276 + 10609579845225 = 735174^2 + 3257235^2 .
It is not a de Polignac number, because 11150060655501 - 25 = 11150060655469 is a prime.
It is a super-2 number, since 2×111500606555012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11150060655509) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 461917696 + ... + 461941833.
It is an arithmetic number, because the mean of its divisors is an integer number (838402523475).
Almost surely, 211150060655501 is an apocalyptic number.
It is an amenable number.
11150060655501 is a deficient number, since it is larger than the sum of its proper divisors (5617989813999).
11150060655501 is an equidigital number, since it uses as much as digits as its factorization.
11150060655501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 923859690 (or 923859681 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 36.
The spelling of 11150060655501 in words is "eleven trillion, one hundred fifty billion, sixty million, six hundred fifty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •