Base | Representation |
---|---|
bin | 110101010101011000… |
… | …0100001001010000101 |
3 | 101221122001220210110001 |
4 | 1222222300201022011 |
5 | 3334031200321031 |
6 | 124341033001301 |
7 | 11163154616116 |
oct | 1525260411205 |
9 | 357561823401 |
10 | 114533995141 |
11 | 446344aa835 |
12 | 1a245253231 |
13 | aa53946c77 |
14 | 578741c20d |
15 | 2ea519d861 |
hex | 1aaac21285 |
114533995141 has 4 divisors (see below), whose sum is σ = 114548894784. Its totient is φ = 114519095500.
The previous prime is 114533995109. The next prime is 114533995193. The reversal of 114533995141 is 141599335411.
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.
It is a cyclic number.
It is not a de Polignac number, because 114533995141 - 25 = 114533995109 is a prime.
It is a super-2 number, since 2×1145339951412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114533995091 and 114533995100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114533995241) 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, 7438285 + ... + 7453666.
It is an arithmetic number, because the mean of its divisors is an integer number (28637223696).
Almost surely, 2114533995141 is an apocalyptic number.
It is an amenable number.
114533995141 is a deficient number, since it is larger than the sum of its proper divisors (14899643).
114533995141 is an equidigital number, since it uses as much as digits as its factorization.
114533995141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14899642.
The product of its digits is 291600, while the sum is 46.
The spelling of 114533995141 in words is "one hundred fourteen billion, five hundred thirty-three million, nine hundred ninety-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •