Base | Representation |
---|---|
bin | 110101001001000101… |
… | …0010101011100010101 |
3 | 101220120022102100201120 |
4 | 1222102022111130111 |
5 | 3332210030120001 |
6 | 124232052114153 |
7 | 11150014215051 |
oct | 1522212253425 |
9 | 356508370646 |
10 | 114121332501 |
11 | 44442576230 |
12 | 1a14b005959 |
13 | a9b92c0ba7 |
14 | 57486bcc61 |
15 | 2e7dd38236 |
hex | 1a92295715 |
114121332501 has 8 divisors (see below), whose sum is σ = 165994665504. Its totient is φ = 69164443920.
The previous prime is 114121332473. The next prime is 114121332547. The reversal of 114121332501 is 105233121411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114121332501 - 210 = 114121331477 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114121332301) 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, 1729111066 + ... + 1729111131.
It is an arithmetic number, because the mean of its divisors is an integer number (20749333188).
Almost surely, 2114121332501 is an apocalyptic number.
114121332501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
114121332501 is a deficient number, since it is larger than the sum of its proper divisors (51873333003).
114121332501 is a wasteful number, since it uses less digits than its factorization.
114121332501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3458222211.
The product of its (nonzero) digits is 720, while the sum is 24.
Adding to 114121332501 its reverse (105233121411), we get a palindrome (219354453912).
The spelling of 114121332501 in words is "one hundred fourteen billion, one hundred twenty-one million, three hundred thirty-two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •