Base | Representation |
---|---|
bin | 110110001101000011… |
… | …1011000101010111001 |
3 | 102010110021101111221110 |
4 | 1230122013120222321 |
5 | 3401342434320130 |
6 | 125250252230533 |
7 | 11260361614305 |
oct | 1543207305271 |
9 | 363407344843 |
10 | 116402260665 |
11 | 45403050329 |
12 | 1a686a6b449 |
13 | ac90a19222 |
14 | 58c35c4d05 |
15 | 30641ddab0 |
hex | 1b1a1d8ab9 |
116402260665 has 64 divisors (see below), whose sum is σ = 201461354496. Its totient is φ = 57236458752.
The previous prime is 116402260643. The next prime is 116402260693. The reversal of 116402260665 is 566062204611.
It is not a de Polignac number, because 116402260665 - 25 = 116402260633 is a prime.
It is a Curzon number.
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 63 ways as a sum of consecutive naturals, for example, 1323244 + ... + 1408466.
It is an arithmetic number, because the mean of its divisors is an integer number (3147833664).
Almost surely, 2116402260665 is an apocalyptic number.
116402260665 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
116402260665 is a deficient number, since it is larger than the sum of its proper divisors (85059093831).
116402260665 is a wasteful number, since it uses less digits than its factorization.
116402260665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85398.
The product of its (nonzero) digits is 103680, while the sum is 39.
The spelling of 116402260665 in words is "one hundred sixteen billion, four hundred two million, two hundred sixty thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •