Base | Representation |
---|---|
bin | 11010001010001101001011… |
… | …001100110101110000001010 |
3 | 120002100201120200120020000010 |
4 | 122022031023030311300022 |
5 | 110034442011424140200 |
6 | 1044405254315252350 |
7 | 33143061616440321 |
oct | 3212151314656012 |
9 | 502321520506003 |
10 | 115050550615050 |
11 | 33727734507a66 |
12 | 10aa169874a0b6 |
13 | 4c272b31cc85b |
14 | 205a6951c70b8 |
15 | d47adecde150 |
hex | 68a34b335c0a |
115050550615050 has 192 divisors, whose sum is σ = 293737959567360. Its totient is φ = 29784753600000.
The previous prime is 115050550615003. The next prime is 115050550615079. The reversal of 115050550615050 is 50516055050511.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 775402870 + ... + 775551230.
It is an arithmetic number, because the mean of its divisors is an integer number (1529885206080).
Almost surely, 2115050550615050 is an apocalyptic number.
115050550615050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 115050550615050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146868979783680).
115050550615050 is an abundant number, since it is smaller than the sum of its proper divisors (178687408952310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115050550615050 is a wasteful number, since it uses less digits than its factorization.
115050550615050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149149 (or 149144 counting only the distinct ones).
The product of its (nonzero) digits is 93750, while the sum is 39.
The spelling of 115050550615050 in words is "one hundred fifteen trillion, fifty billion, five hundred fifty million, six hundred fifteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •