Base | Representation |
---|---|
bin | 110101101000000011… |
… | …1000100111000110011 |
3 | 102000020202002221202221 |
4 | 1223100013010320303 |
5 | 3341322112300101 |
6 | 124523140421511 |
7 | 11214534335623 |
oct | 1532007047063 |
9 | 360222087687 |
10 | 115160665651 |
11 | 44926214649 |
12 | 1a39b0a7897 |
13 | ab23720215 |
14 | 5806748883 |
15 | 2ee01d8aa1 |
hex | 1ad01c4e33 |
115160665651 has 32 divisors (see below), whose sum is σ = 127547066880. Its totient is φ = 103511748096.
The previous prime is 115160665589. The next prime is 115160665661. The reversal of 115160665651 is 156566061511.
It is a cyclic number.
It is not a de Polignac number, because 115160665651 - 27 = 115160665523 is a prime.
It is a super-2 number, since 2×1151606656512 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115160665598 and 115160665607.
It is not an unprimeable number, because it can be changed into a prime (115160665661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29204386 + ... + 29208328.
It is an arithmetic number, because the mean of its divisors is an integer number (3985845840).
Almost surely, 2115160665651 is an apocalyptic number.
115160665651 is a deficient number, since it is larger than the sum of its proper divisors (12386401229).
115160665651 is a wasteful number, since it uses less digits than its factorization.
115160665651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4843.
The product of its (nonzero) digits is 162000, while the sum is 43.
The spelling of 115160665651 in words is "one hundred fifteen billion, one hundred sixty million, six hundred sixty-five thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •