Base | Representation |
---|---|
bin | 110101101001101101… |
… | …0111001111111011110 |
3 | 102000101121121011110212 |
4 | 1223103122321333132 |
5 | 3341430321224200 |
6 | 124532442532422 |
7 | 11216110334441 |
oct | 1532332717736 |
9 | 360347534425 |
10 | 115216195550 |
11 | 449545a2025 |
12 | 1a3b5807112 |
13 | ab32093651 |
14 | 580dc81658 |
15 | 2ee5007035 |
hex | 1ad36b9fde |
115216195550 has 24 divisors (see below), whose sum is σ = 216198613296. Its totient is φ = 45678631040.
The previous prime is 115216195541. The next prime is 115216195559. The reversal of 115216195550 is 55591612511.
It is an interprime number because it is at equal distance from previous prime (115216195541) and next prime (115216195559).
It is a hoax number, since the sum of its digits (41) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 115216195498 and 115216195507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115216195559) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10190474 + ... + 10201773.
It is an arithmetic number, because the mean of its divisors is an integer number (9008275554).
Almost surely, 2115216195550 is an apocalyptic number.
115216195550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
115216195550 is a deficient number, since it is larger than the sum of its proper divisors (100982417746).
115216195550 is a wasteful number, since it uses less digits than its factorization.
115216195550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20392372 (or 20392367 counting only the distinct ones).
The product of its (nonzero) digits is 67500, while the sum is 41.
The spelling of 115216195550 in words is "one hundred fifteen billion, two hundred sixteen million, one hundred ninety-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •