Base | Representation |
---|---|
bin | 110101000111000111… |
… | …1011100000110101001 |
3 | 101220101201122212001210 |
4 | 1222032033130012221 |
5 | 3332041210433031 |
6 | 124221342303333 |
7 | 11145255164220 |
oct | 1521617340651 |
9 | 356351585053 |
10 | 114055561641 |
11 | 4440943364a |
12 | 1a130b87b49 |
13 | a9a87a3318 |
14 | 573da7bcb7 |
15 | 2e78195746 |
hex | 1a8e3dc1a9 |
114055561641 has 8 divisors (see below), whose sum is σ = 173798951104. Its totient is φ = 65174606640.
The previous prime is 114055561561. The next prime is 114055561657. The reversal of 114055561641 is 146165550411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114055561641 - 211 = 114055559593 is a prime.
It is a super-2 number, since 2×1140555616412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114055561641.
It is not an unprimeable number, because it can be changed into a prime (114055561661) 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 7 ways as a sum of consecutive naturals, for example, 2715608590 + ... + 2715608631.
It is an arithmetic number, because the mean of its divisors is an integer number (21724868888).
Almost surely, 2114055561641 is an apocalyptic number.
It is an amenable number.
114055561641 is a deficient number, since it is larger than the sum of its proper divisors (59743389463).
114055561641 is an equidigital number, since it uses as much as digits as its factorization.
114055561641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5431217231.
The product of its (nonzero) digits is 72000, while the sum is 39.
The spelling of 114055561641 in words is "one hundred fourteen billion, fifty-five million, five hundred sixty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •