Base | Representation |
---|---|
bin | 110101110110101011… |
… | …1101001110110011100 |
3 | 102001111221210111100201 |
4 | 1223231113221312130 |
5 | 3343323244104440 |
6 | 125043554033244 |
7 | 11232644650264 |
oct | 1535527516634 |
9 | 361457714321 |
10 | 115651550620 |
11 | 45058315801 |
12 | 1a4b7578824 |
13 | aba13334b8 |
14 | 5851a0a7a4 |
15 | 301d35119a |
hex | 1aed5e9d9c |
115651550620 has 24 divisors (see below), whose sum is σ = 243388336464. Its totient is φ = 46161557376.
The previous prime is 115651550617. The next prime is 115651550621. The reversal of 115651550620 is 26055156511.
It is a self number, because there is not a number n which added to its sum of digits gives 115651550620.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115651550621) 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, 6181857 + ... + 6200536.
It is an arithmetic number, because the mean of its divisors is an integer number (10141180686).
Almost surely, 2115651550620 is an apocalyptic number.
115651550620 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115651550620 is an abundant number, since it is smaller than the sum of its proper divisors (127736785844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115651550620 is a wasteful number, since it uses less digits than its factorization.
115651550620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12382869 (or 12382867 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 37.
The spelling of 115651550620 in words is "one hundred fifteen billion, six hundred fifty-one million, five hundred fifty thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •