Base | Representation |
---|---|
bin | 110101011010011000… |
… | …1100110001100010111 |
3 | 101222001210010212110201 |
4 | 1222310301212030113 |
5 | 3334402211100241 |
6 | 124405435001331 |
7 | 11200265224150 |
oct | 1526461461427 |
9 | 358053125421 |
10 | 114702050071 |
11 | 44710353a04 |
12 | 1a291599247 |
13 | aa7c6c7b5b |
14 | 57a1886927 |
15 | 2eb4ce7931 |
hex | 1ab4c66317 |
114702050071 has 4 divisors (see below), whose sum is σ = 131088057232. Its totient is φ = 98316042912.
The previous prime is 114702050053. The next prime is 114702050081. The reversal of 114702050071 is 170050207411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114702050071 is a prime.
It is a super-2 number, since 2×1147020500712 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114702050011) 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, 8193003570 + ... + 8193003583.
It is an arithmetic number, because the mean of its divisors is an integer number (32772014308).
Almost surely, 2114702050071 is an apocalyptic number.
114702050071 is a deficient number, since it is larger than the sum of its proper divisors (16386007161).
114702050071 is an equidigital number, since it uses as much as digits as its factorization.
114702050071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16386007160.
The product of its (nonzero) digits is 1960, while the sum is 28.
Adding to 114702050071 its reverse (170050207411), we get a palindrome (284752257482).
The spelling of 114702050071 in words is "one hundred fourteen billion, seven hundred two million, fifty thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •