Base | Representation |
---|---|
bin | 110110001100111101… |
… | …1000001010101001101 |
3 | 102010110001021211200102 |
4 | 1230121323001111031 |
5 | 3401341122104331 |
6 | 125250054540445 |
7 | 11260322224343 |
oct | 1543173012515 |
9 | 363401254612 |
10 | 116399019341 |
11 | 45401237050 |
12 | 1a685967725 |
13 | ac90152a97 |
14 | 58c2dbd993 |
15 | 3063c9d4cb |
hex | 1b19ec154d |
116399019341 has 4 divisors (see below), whose sum is σ = 126980748384. Its totient is φ = 105817290300.
The previous prime is 116399019337. The next prime is 116399019343. The reversal of 116399019341 is 143910993611.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 116399019341 - 22 = 116399019337 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116399019343) 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 3 ways as a sum of consecutive naturals, for example, 5290864505 + ... + 5290864526.
It is an arithmetic number, because the mean of its divisors is an integer number (31745187096).
Almost surely, 2116399019341 is an apocalyptic number.
116399019341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
116399019341 is a deficient number, since it is larger than the sum of its proper divisors (10581729043).
116399019341 is a wasteful number, since it uses less digits than its factorization.
116399019341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10581729042.
The product of its (nonzero) digits is 157464, while the sum is 47.
The spelling of 116399019341 in words is "one hundred sixteen billion, three hundred ninety-nine million, nineteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •