Base | Representation |
---|---|
bin | 11010001010000011100011… |
… | …001010000110010001011001 |
3 | 120002022201220101112020120220 |
4 | 122022003203022012101121 |
5 | 110034304330033144400 |
6 | 1044400424550110253 |
7 | 33142244526330366 |
oct | 3212034312062131 |
9 | 502281811466526 |
10 | 115040215131225 |
11 | 33723310392a9a |
12 | 10a9b69334b389 |
13 | 4c26326b6c557 |
14 | 2059d9469546d |
15 | d476d77637a0 |
hex | 68a0e3286459 |
115040215131225 has 24 divisors (see below), whose sum is σ = 190374157794912. Its totient is φ = 61298544163200.
The previous prime is 115040215131217. The next prime is 115040215131269. The reversal of 115040215131225 is 522131512040511.
It is not a de Polignac number, because 115040215131225 - 23 = 115040215131217 is a prime.
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 23 ways as a sum of consecutive naturals, for example, 702883132 + ... + 703046781.
It is an arithmetic number, because the mean of its divisors is an integer number (7932256574788).
Almost surely, 2115040215131225 is an apocalyptic number.
115040215131225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
115040215131225 is a deficient number, since it is larger than the sum of its proper divisors (75333942663687).
115040215131225 is a wasteful number, since it uses less digits than its factorization.
115040215131225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1405931017 (or 1405931012 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 33.
Adding to 115040215131225 its reverse (522131512040511), we get a palindrome (637171727171736).
The spelling of 115040215131225 in words is "one hundred fifteen trillion, forty billion, two hundred fifteen million, one hundred thirty-one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •