Base | Representation |
---|---|
bin | 11010001101110101101000… |
… | …000101001000000110101001 |
3 | 120010020120211020010001102210 |
4 | 122031311220011020012221 |
5 | 110103034143132013442 |
6 | 1045120053215315333 |
7 | 33200106014631513 |
oct | 3215655005100651 |
9 | 503216736101383 |
10 | 115300143235497 |
11 | 33813574a959a0 |
12 | 10b21b3481bb49 |
13 | 4c449aba6524c |
14 | 20687b1872bb3 |
15 | d4e34be8819c |
hex | 68dd681481a9 |
115300143235497 has 32 divisors (see below), whose sum is σ = 168563169967104. Its totient is φ = 69523105982400.
The previous prime is 115300143235463. The next prime is 115300143235531. The reversal of 115300143235497 is 794532341003511.
It is an interprime number because it is at equal distance from previous prime (115300143235463) and next prime (115300143235531).
It is not a de Polignac number, because 115300143235497 - 210 = 115300143234473 is a prime.
It is a super-2 number, since 2×1153001432354972 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (115300143235097) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 756451668 + ... + 756604074.
It is an arithmetic number, because the mean of its divisors is an integer number (5267599061472).
Almost surely, 2115300143235497 is an apocalyptic number.
It is an amenable number.
115300143235497 is a deficient number, since it is larger than the sum of its proper divisors (53263026731607).
115300143235497 is a wasteful number, since it uses less digits than its factorization.
115300143235497 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 268989.
The product of its (nonzero) digits is 1360800, while the sum is 48.
The spelling of 115300143235497 in words is "one hundred fifteen trillion, three hundred billion, one hundred forty-three million, two hundred thirty-five thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •