Base | Representation |
---|---|
bin | 11010001100110000110100… |
… | …000110010000011100110000 |
3 | 120002222112002221111202111202 |
4 | 122030300310012100130300 |
5 | 110100331333202010220 |
6 | 1045022113410030332 |
7 | 33161552025333545 |
oct | 3214606406203460 |
9 | 502875087452452 |
10 | 115226256672560 |
11 | 337951a9a49640 |
12 | 10b0b7542783a8 |
13 | 4c3aa35365b17 |
14 | 2064da29d4bcc |
15 | d4c47555d275 |
hex | 68cc34190730 |
115226256672560 has 80 divisors (see below), whose sum is σ = 293724309369600. Its totient is φ = 41689901848320.
The previous prime is 115226256672539. The next prime is 115226256672623. The reversal of 115226256672560 is 65276652622511.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 115226256672496 and 115226256672505.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 328817162 + ... + 329167401.
It is an arithmetic number, because the mean of its divisors is an integer number (3671553867120).
Almost surely, 2115226256672560 is an apocalyptic number.
115226256672560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115226256672560 is an abundant number, since it is smaller than the sum of its proper divisors (178498052697040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115226256672560 is a wasteful number, since it uses less digits than its factorization.
115226256672560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 657984786 (or 657984780 counting only the distinct ones).
The product of its (nonzero) digits is 18144000, while the sum is 56.
The spelling of 115226256672560 in words is "one hundred fifteen trillion, two hundred twenty-six billion, two hundred fifty-six million, six hundred seventy-two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •