Base | Representation |
---|---|
bin | 110110001010000100… |
… | …1101001110101001111 |
3 | 102010012022002111110210 |
4 | 1230110021221311033 |
5 | 3401141330120301 |
6 | 125232315333503 |
7 | 11255035214631 |
oct | 1542411516517 |
9 | 363168074423 |
10 | 116302191951 |
11 | 45361612210 |
12 | 1a659451293 |
13 | ac7608037a |
14 | 58b41b6a51 |
15 | 305a523ad6 |
hex | 1b14269d4f |
116302191951 has 16 divisors (see below), whose sum is σ = 170841748608. Its totient is φ = 69788292000.
The previous prime is 116302191923. The next prime is 116302191959. The reversal of 116302191951 is 159191203611.
It is not a de Polignac number, because 116302191951 - 211 = 116302189903 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116302191959) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 17443741 + ... + 17450406.
It is an arithmetic number, because the mean of its divisors is an integer number (10677609288).
Almost surely, 2116302191951 is an apocalyptic number.
116302191951 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
116302191951 is a deficient number, since it is larger than the sum of its proper divisors (54539556657).
116302191951 is a wasteful number, since it uses less digits than its factorization.
116302191951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34894262.
The product of its (nonzero) digits is 14580, while the sum is 39.
The spelling of 116302191951 in words is "one hundred sixteen billion, three hundred two million, one hundred ninety-one thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •