Base | Representation |
---|---|
bin | 110101001010010110… |
… | …1100110001000110001 |
3 | 101220200021221201100012 |
4 | 1222110231212020301 |
5 | 3332302004132403 |
6 | 124240221304305 |
7 | 11151044045120 |
oct | 1522455461061 |
9 | 356607851305 |
10 | 114164130353 |
11 | 44464747959 |
12 | 1a161405095 |
13 | a9c5127070 |
14 | 575025dab7 |
15 | 2e8298ded8 |
hex | 1a94b66231 |
114164130353 has 8 divisors (see below), whose sum is σ = 140509699008. Its totient is φ = 90327663504.
The previous prime is 114164130337. The next prime is 114164130359. The reversal of 114164130353 is 353031461411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114164130353 - 24 = 114164130337 is a prime.
It is not an unprimeable number, because it can be changed into a prime (114164130359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 627275351 + ... + 627275532.
It is an arithmetic number, because the mean of its divisors is an integer number (17563712376).
Almost surely, 2114164130353 is an apocalyptic number.
114164130353 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
114164130353 is a deficient number, since it is larger than the sum of its proper divisors (26345568655).
114164130353 is a wasteful number, since it uses less digits than its factorization.
114164130353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1254550903.
The product of its (nonzero) digits is 12960, while the sum is 32.
Adding to 114164130353 its reverse (353031461411), we get a palindrome (467195591764).
The spelling of 114164130353 in words is "one hundred fourteen billion, one hundred sixty-four million, one hundred thirty thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •