Base | Representation |
---|---|
bin | 11010000110001100100101… |
… | …010100011001100011101100 |
3 | 120001101101102200101100001221 |
4 | 122012030211110121203230 |
5 | 110020433234002434224 |
6 | 1044034531341513124 |
7 | 33114136262613622 |
oct | 3206144524314354 |
9 | 501341380340057 |
10 | 114775037155564 |
11 | 33630902328005 |
12 | 10a582078727a4 |
13 | 4c0731641bc96 |
14 | 204b1da171512 |
15 | d408671cb6e4 |
hex | 6863255198ec |
114775037155564 has 12 divisors (see below), whose sum is σ = 207782394850800. Its totient is φ = 55408638626768.
The previous prime is 114775037155553. The next prime is 114775037155567. The reversal of 114775037155564 is 465551730577411.
It is a super-2 number, since 2×1147750371555642 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (114775037155567) 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, 494719987624 + ... + 494719987855.
It is an arithmetic number, because the mean of its divisors is an integer number (17315199570900).
Almost surely, 2114775037155564 is an apocalyptic number.
It is an amenable number.
114775037155564 is a deficient number, since it is larger than the sum of its proper divisors (93007357695236).
114775037155564 is a wasteful number, since it uses less digits than its factorization.
114775037155564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 989439975512 (or 989439975510 counting only the distinct ones).
The product of its (nonzero) digits is 61740000, while the sum is 61.
The spelling of 114775037155564 in words is "one hundred fourteen trillion, seven hundred seventy-five billion, thirty-seven million, one hundred fifty-five thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •