Base | Representation |
---|---|
bin | 11010001010110100010110… |
… | …000010110111001011000010 |
3 | 120002111202010202212010102200 |
4 | 122022310112002313023002 |
5 | 110041134130232324223 |
6 | 1044440451525254030 |
7 | 33146111062415235 |
oct | 3212642602671302 |
9 | 502452122763380 |
10 | 115092608479938 |
11 | 33743557035391 |
12 | 10aa9875864316 |
13 | 4c2b25670963b |
14 | 205c724bd341c |
15 | d48c522b8a43 |
hex | 68ad160b72c2 |
115092608479938 has 24 divisors (see below), whose sum is σ = 249369245147568. Its totient is φ = 38363906399832.
The previous prime is 115092608479879. The next prime is 115092608479957. The reversal of 115092608479938 is 839974806290511.
115092608479938 is a `hidden beast` number, since 1 + 1 + 5 + 0 + 9 + 2 + 60 + 8 + 479 + 93 + 8 = 666.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22301620 + ... + 26973087.
It is an arithmetic number, because the mean of its divisors is an integer number (10390385214482).
It is a 1-persistent number, because it is pandigital, but 2⋅115092608479938 = 230185216959876 is not.
Almost surely, 2115092608479938 is an apocalyptic number.
115092608479938 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
115092608479938 is an abundant number, since it is smaller than the sum of its proper divisors (134276636667630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115092608479938 is a wasteful number, since it uses less digits than its factorization.
115092608479938 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49404478 (or 49404475 counting only the distinct ones).
The product of its (nonzero) digits is 235146240, while the sum is 72.
The spelling of 115092608479938 in words is "one hundred fifteen trillion, ninety-two billion, six hundred eight million, four hundred seventy-nine thousand, nine hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •