Base | Representation |
---|---|
bin | 10000001110101101001… |
… | …001101010101011000001 |
3 | 10221121210021120121222222 |
4 | 100032231021222223001 |
5 | 121233114142201423 |
6 | 2212210142140425 |
7 | 143402132343122 |
oct | 20165511525301 |
9 | 3847707517888 |
10 | 1115301522113 |
11 | 39aaa66a7039 |
12 | 1601a0281715 |
13 | 81231c35b7c |
14 | 3bda377a049 |
15 | 1e028ec53c8 |
hex | 103ad26aac1 |
1115301522113 has 6 divisors (see below), whose sum is σ = 1184766669126. Its totient is φ = 1049695549952.
The previous prime is 1115301522103. The next prime is 1115301522163. The reversal of 1115301522113 is 3112251035111.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 697873110544 + 417428411569 = 835388^2 + 646087^2 .
It is not a de Polignac number, because 1115301522113 - 224 = 1115284744897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1115301522103) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1929587120 + ... + 1929587697.
It is an arithmetic number, because the mean of its divisors is an integer number (197461111521).
Almost surely, 21115301522113 is an apocalyptic number.
It is an amenable number.
1115301522113 is a deficient number, since it is larger than the sum of its proper divisors (69465147013).
1115301522113 is an equidigital number, since it uses as much as digits as its factorization.
1115301522113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3859174851 (or 3859174834 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 1115301522113 its reverse (3112251035111), we get a palindrome (4227552557224).
The spelling of 1115301522113 in words is "one trillion, one hundred fifteen billion, three hundred one million, five hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •