Base | Representation |
---|---|
bin | 110101110010100111… |
… | …0111111100001000000 |
3 | 102001011102222011122002 |
4 | 1223211032333201000 |
5 | 3343033323443321 |
6 | 125022240403132 |
7 | 11226366554252 |
oct | 1534516774100 |
9 | 361142864562 |
10 | 115515062336 |
11 | 44a98272073 |
12 | 1a4799164a8 |
13 | ab7bc856bb |
14 | 583b83bcd2 |
15 | 301139020b |
hex | 1ae53bf840 |
115515062336 has 28 divisors (see below), whose sum is σ = 232646482128. Its totient is φ = 56895476352.
The previous prime is 115515062329. The next prime is 115515062393. The reversal of 115515062336 is 633260515511.
115515062336 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 115515062336.
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 3 ways as a sum of consecutive naturals, for example, 13465286 + ... + 13473861.
Almost surely, 2115515062336 is an apocalyptic number.
115515062336 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
115515062336 is an abundant number, since it is smaller than the sum of its proper divisors (117131419792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115515062336 is an equidigital number, since it uses as much as digits as its factorization.
115515062336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26939226 (or 26939216 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 38.
Adding to 115515062336 its reverse (633260515511), we get a palindrome (748775577847).
The spelling of 115515062336 in words is "one hundred fifteen billion, five hundred fifteen million, sixty-two thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •