Base | Representation |
---|---|
bin | 110110011001110011… |
… | …0011111010011011101 |
3 | 102011120001222000222020 |
4 | 1230303212133103131 |
5 | 3403231420012301 |
6 | 125400525010353 |
7 | 11304103203063 |
oct | 1546346372335 |
9 | 364501860866 |
10 | 116829844701 |
11 | 45602446569 |
12 | 1a7860b39b9 |
13 | b02b497c2b |
14 | 59242ca033 |
15 | 308ba00436 |
hex | 1b3399f4dd |
116829844701 has 4 divisors (see below), whose sum is σ = 155773126272. Its totient is φ = 77886563132.
The previous prime is 116829844669. The next prime is 116829844717. The reversal of 116829844701 is 107448928611.
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 116829844701 - 25 = 116829844669 is a prime.
It is a super-2 number, since 2×1168298447012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116829844721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19471640781 + ... + 19471640786.
It is an arithmetic number, because the mean of its divisors is an integer number (38943281568).
Almost surely, 2116829844701 is an apocalyptic number.
It is an amenable number.
116829844701 is a deficient number, since it is larger than the sum of its proper divisors (38943281571).
116829844701 is an equidigital number, since it uses as much as digits as its factorization.
116829844701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38943281570.
The product of its (nonzero) digits is 774144, while the sum is 51.
The spelling of 116829844701 in words is "one hundred sixteen billion, eight hundred twenty-nine million, eight hundred forty-four thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •