Base | Representation |
---|---|
bin | 11010001001011111001111… |
… | …100011001000011001100001 |
3 | 120002012000021112211201111202 |
4 | 122021133033203020121201 |
5 | 110033140010222143203 |
6 | 1044330500354250545 |
7 | 33136364502420320 |
oct | 3211371743103141 |
9 | 502160245751452 |
10 | 115001231443553 |
11 | 3370882608a4a4 |
12 | 10a94013886a55 |
13 | 4c22753518c40 |
14 | 20581370800b7 |
15 | d466a50d1388 |
hex | 6897cf8c8661 |
115001231443553 has 32 divisors (see below), whose sum is σ = 150132050885376. Its totient is φ = 85485523120128.
The previous prime is 115001231443541. The next prime is 115001231443561. The reversal of 115001231443553 is 355344132100511.
It is a cyclic number.
It is not a de Polignac number, because 115001231443553 - 218 = 115001231181409 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (115001231443583) 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 31 ways as a sum of consecutive naturals, for example, 65148776 + ... + 66890697.
It is an arithmetic number, because the mean of its divisors is an integer number (4691626590168).
Almost surely, 2115001231443553 is an apocalyptic number.
115001231443553 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
115001231443553 is a deficient number, since it is larger than the sum of its proper divisors (35130819441823).
115001231443553 is a wasteful number, since it uses less digits than its factorization.
115001231443553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132040073.
The product of its (nonzero) digits is 108000, while the sum is 38.
The spelling of 115001231443553 in words is "one hundred fifteen trillion, one billion, two hundred thirty-one million, four hundred forty-three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •