Base | Representation |
---|---|
bin | 110101011011001011… |
… | …0101101011101011001 |
3 | 101222010122000112021202 |
4 | 1222312112231131121 |
5 | 3334431002301002 |
6 | 124412223043545 |
7 | 11201036432051 |
oct | 1526626553531 |
9 | 358118015252 |
10 | 114728556377 |
11 | 44724308546 |
12 | 1a29a4405b5 |
13 | aa85048866 |
14 | 57a51c6561 |
15 | 2eb72d1502 |
hex | 1ab65ad759 |
114728556377 has 4 divisors (see below), whose sum is σ = 116673108240. Its totient is φ = 112784004516.
The previous prime is 114728556359. The next prime is 114728556389. The reversal of 114728556377 is 773655827411.
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: 773655827411 = 113 ⋅6846511747.
It is a cyclic number.
It is not a de Polignac number, because 114728556377 - 228 = 114460120921 is a prime.
It is a super-2 number, since 2×1147285563772 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114728556977) 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, 972275843 + ... + 972275960.
It is an arithmetic number, because the mean of its divisors is an integer number (29168277060).
Almost surely, 2114728556377 is an apocalyptic number.
It is an amenable number.
114728556377 is a deficient number, since it is larger than the sum of its proper divisors (1944551863).
114728556377 is an equidigital number, since it uses as much as digits as its factorization.
114728556377 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1944551862.
The product of its digits is 9878400, while the sum is 56.
The spelling of 114728556377 in words is "one hundred fourteen billion, seven hundred twenty-eight million, five hundred fifty-six thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •