Base | Representation |
---|---|
bin | 1010011101101011011101… |
… | …1110100010100010111110 |
3 | 1111201212102021110222122210 |
4 | 2213122313132202202332 |
5 | 3001444220131430123 |
6 | 40245154020121250 |
7 | 2265131433006132 |
oct | 247326736424276 |
9 | 44655367428583 |
10 | 11505000655038 |
11 | 3736274a31570 |
12 | 13598b5536226 |
13 | 655bbc59c8b7 |
14 | 2babb898b3c2 |
15 | 14e411322e93 |
hex | a76b77a28be |
11505000655038 has 64 divisors (see below), whose sum is σ = 26590886737920. Its totient is φ = 3279741696000.
The previous prime is 11505000654991. The next prime is 11505000655039. The reversal of 11505000655038 is 83055600050511.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11505000654987 and 11505000655005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11505000655039) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19438 + ... + 4796913.
It is an arithmetic number, because the mean of its divisors is an integer number (415482605280).
Almost surely, 211505000655038 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11505000655038, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13295443368960).
11505000655038 is an abundant number, since it is smaller than the sum of its proper divisors (15085886082882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11505000655038 is a wasteful number, since it uses less digits than its factorization.
11505000655038 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4818513.
The product of its (nonzero) digits is 90000, while the sum is 39.
The spelling of 11505000655038 in words is "eleven trillion, five hundred five billion, six hundred fifty-five thousand, thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •