Base | Representation |
---|---|
bin | 110110000100000001… |
… | …0100000111111100001 |
3 | 102002200010201222111010 |
4 | 1230020002200333201 |
5 | 3400232320303040 |
6 | 125200220211133 |
7 | 11250020111331 |
oct | 1541002407741 |
9 | 362603658433 |
10 | 116098994145 |
11 | 45267945742 |
12 | 1a601399aa9 |
13 | ac42c46694 |
14 | 58952010c1 |
15 | 3047786e80 |
hex | 1b080a0fe1 |
116098994145 has 8 divisors (see below), whose sum is σ = 185758390656. Its totient is φ = 61919463536.
The previous prime is 116098994107. The next prime is 116098994147. The reversal of 116098994145 is 541499890611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 116098994145 - 213 = 116098985953 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (116098994147) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3869966457 + ... + 3869966486.
It is an arithmetic number, because the mean of its divisors is an integer number (23219798832).
Almost surely, 2116098994145 is an apocalyptic number.
116098994145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
116098994145 is a deficient number, since it is larger than the sum of its proper divisors (69659396511).
116098994145 is an equidigital number, since it uses as much as digits as its factorization.
116098994145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7739932951.
The product of its (nonzero) digits is 2799360, while the sum is 57.
The spelling of 116098994145 in words is "one hundred sixteen billion, ninety-eight million, nine hundred ninety-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •