Base | Representation |
---|---|
bin | 110101001111111101… |
… | …1100001100101000101 |
3 | 101221011102002022012101 |
4 | 1222133323201211011 |
5 | 3333143144043302 |
6 | 124311023152101 |
7 | 11155520530225 |
oct | 1523773414505 |
9 | 357142068171 |
10 | 114352331077 |
11 | 44550a00946 |
12 | 1a1b4445631 |
13 | aa2510c83a |
14 | 576b250085 |
15 | 2e94267287 |
hex | 1a9fee1945 |
114352331077 has 4 divisors (see below), whose sum is σ = 116290506240. Its totient is φ = 112414155916.
The previous prime is 114352331059. The next prime is 114352331081. The reversal of 114352331077 is 770133253411.
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, and also an emirpimes, since its reverse is a distinct semiprime: 770133253411 = 17 ⋅45301956083.
It is a cyclic number.
It is not a de Polignac number, because 114352331077 - 227 = 114218113349 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 (114352332077) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 969087493 + ... + 969087610.
It is an arithmetic number, because the mean of its divisors is an integer number (29072626560).
Almost surely, 2114352331077 is an apocalyptic number.
It is an amenable number.
114352331077 is a deficient number, since it is larger than the sum of its proper divisors (1938175163).
114352331077 is an equidigital number, since it uses as much as digits as its factorization.
114352331077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1938175162.
The product of its (nonzero) digits is 52920, while the sum is 37.
Adding to 114352331077 its reverse (770133253411), we get a palindrome (884485584488).
The spelling of 114352331077 in words is "one hundred fourteen billion, three hundred fifty-two million, three hundred thirty-one thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •