Base | Representation |
---|---|
bin | 110101111101100110… |
… | …0111011000000110000 |
3 | 102002010010110202102220 |
4 | 1223323030323000300 |
5 | 3344312201241402 |
6 | 125123004041040 |
7 | 11241463334505 |
oct | 1537314730060 |
9 | 362103422386 |
10 | 115883618352 |
11 | 45167310717 |
12 | 1a561233180 |
13 | ac0a437998 |
14 | 58747794ac |
15 | 30338e1dbc |
hex | 1afb33b030 |
115883618352 has 80 divisors (see below), whose sum is σ = 315188160000. Its totient is φ = 36587158272.
The previous prime is 115883618341. The next prime is 115883618363. The reversal of 115883618352 is 253816388511.
It is an interprime number because it is at equal distance from previous prime (115883618341) and next prime (115883618363).
It is a junction number, because it is equal to n+sod(n) for n = 115883618295 and 115883618304.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5670649 + ... + 5691047.
It is an arithmetic number, because the mean of its divisors is an integer number (3939852000).
Almost surely, 2115883618352 is an apocalyptic number.
115883618352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
115883618352 is an abundant number, since it is smaller than the sum of its proper divisors (199304541648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115883618352 is a wasteful number, since it uses less digits than its factorization.
115883618352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26658 (or 26652 counting only the distinct ones).
The product of its digits is 1382400, while the sum is 51.
The spelling of 115883618352 in words is "one hundred fifteen billion, eight hundred eighty-three million, six hundred eighteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •