Base | Representation |
---|---|
bin | 11010000101100011001010… |
… | …110011001101010111011101 |
3 | 120001020010122121101110121210 |
4 | 122011203022303031113131 |
5 | 110014221201110114402 |
6 | 1044002255023215033 |
7 | 33111003310244043 |
oct | 3205431263152735 |
9 | 501203577343553 |
10 | 114730568832477 |
11 | 33613a630a4774 |
12 | 10a4b677447479 |
13 | 4c0307a704280 |
14 | 2048dbc382393 |
15 | d3e6132b206c |
hex | 6858caccd5dd |
114730568832477 has 32 divisors (see below), whose sum is σ = 174946544841600. Its totient is φ = 66295532685312.
The previous prime is 114730568832469. The next prime is 114730568832491. The reversal of 114730568832477 is 774238865037411.
It is a happy number.
It is not a de Polignac number, because 114730568832477 - 23 = 114730568832469 is a prime.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114730568832277) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 685013952 + ... + 685181417.
It is an arithmetic number, because the mean of its divisors is an integer number (5467079526300).
Almost surely, 2114730568832477 is an apocalyptic number.
It is an amenable number.
114730568832477 is a deficient number, since it is larger than the sum of its proper divisors (60215976009123).
114730568832477 is a wasteful number, since it uses less digits than its factorization.
114730568832477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1370195517.
The product of its (nonzero) digits is 189665280, while the sum is 66.
The spelling of 114730568832477 in words is "one hundred fourteen trillion, seven hundred thirty billion, five hundred sixty-eight million, eight hundred thirty-two thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •