Base | Representation |
---|---|
bin | 11010001101110111000001… |
… | …111110100100100001100100 |
3 | 120010020201201100010010012101 |
4 | 122031313001332210201210 |
5 | 110103100240233410330 |
6 | 1045120503014101444 |
7 | 33200161260450133 |
oct | 3215670176444144 |
9 | 503221640103171 |
10 | 115301651466340 |
11 | 33814179388069 |
12 | 10b2229594a884 |
13 | 4c44b8c379a31 |
14 | 20688b5cb991a |
15 | d4e3d95ab4ca |
hex | 68ddc1fa4864 |
115301651466340 has 48 divisors (see below), whose sum is σ = 244296111532032. Its totient is φ = 45709490647296.
The previous prime is 115301651466269. The next prime is 115301651466341. The reversal of 115301651466340 is 43664156103511.
It is not an unprimeable number, because it can be changed into a prime (115301651466341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21395934 + ... + 26237173.
It is an arithmetic number, because the mean of its divisors is an integer number (5089502323584).
Almost surely, 2115301651466340 is an apocalyptic number.
115301651466340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115301651466340 is an abundant number, since it is smaller than the sum of its proper divisors (128994460065692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115301651466340 is a wasteful number, since it uses less digits than its factorization.
115301651466340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47634196 (or 47634194 counting only the distinct ones).
The product of its (nonzero) digits is 777600, while the sum is 46.
The spelling of 115301651466340 in words is "one hundred fifteen trillion, three hundred one billion, six hundred fifty-one million, four hundred sixty-six thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •