Base | Representation |
---|---|
bin | 110110011100010000… |
… | …0010100011001110110 |
3 | 102011202210202201020021 |
4 | 1230320200110121312 |
5 | 3403414000111040 |
6 | 125413024155354 |
7 | 11306122365121 |
oct | 1547040243166 |
9 | 364683681207 |
10 | 116912113270 |
11 | 45644927117 |
12 | 1a7a9768b5a |
13 | b042540a64 |
14 | 59311c33b8 |
15 | 3093d5124a |
hex | 1b38814676 |
116912113270 has 8 divisors (see below), whose sum is σ = 210441803904. Its totient is φ = 46764845304.
The previous prime is 116912113187. The next prime is 116912113271. The reversal of 116912113270 is 72311219611.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116912113271) 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 3 ways as a sum of consecutive naturals, for example, 5845605654 + ... + 5845605673.
It is an arithmetic number, because the mean of its divisors is an integer number (26305225488).
Almost surely, 2116912113270 is an apocalyptic number.
116912113270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
116912113270 is a deficient number, since it is larger than the sum of its proper divisors (93529690634).
116912113270 is a wasteful number, since it uses less digits than its factorization.
116912113270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11691211334.
The product of its (nonzero) digits is 4536, while the sum is 34.
The spelling of 116912113270 in words is "one hundred sixteen billion, nine hundred twelve million, one hundred thirteen thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •