Base | Representation |
---|---|
bin | 110101111000100111… |
… | …1000111010110111011 |
3 | 102001200110212020212021 |
4 | 1223301033013112323 |
5 | 3343441400433201 |
6 | 125054232255311 |
7 | 11234363231020 |
oct | 1536117072673 |
9 | 361613766767 |
10 | 115716421051 |
11 | 450909a2930 |
12 | 1a515241537 |
13 | abb18c727a |
14 | 585a495547 |
15 | 3023db6ea1 |
hex | 1af13c75bb |
115716421051 has 16 divisors (see below), whose sum is σ = 144278120448. Its totient is φ = 90163454400.
The previous prime is 115716420991. The next prime is 115716421091. The reversal of 115716421051 is 150124617511.
It is a cyclic number.
It is not a de Polignac number, because 115716421051 - 215 = 115716388283 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115716420998 and 115716421016.
It is not an unprimeable number, because it can be changed into a prime (115716421091) 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, 1826166 + ... + 1888468.
It is an arithmetic number, because the mean of its divisors is an integer number (9017382528).
Almost surely, 2115716421051 is an apocalyptic number.
115716421051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
115716421051 is a deficient number, since it is larger than the sum of its proper divisors (28561699397).
115716421051 is a wasteful number, since it uses less digits than its factorization.
115716421051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86442.
The product of its (nonzero) digits is 8400, while the sum is 34.
The spelling of 115716421051 in words is "one hundred fifteen billion, seven hundred sixteen million, four hundred twenty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •