Base | Representation |
---|---|
bin | 110101001100010110… |
… | …1000110110101100101 |
3 | 101220211221222200112101 |
4 | 1222120231012311211 |
5 | 3332421131023023 |
6 | 124251013052101 |
7 | 11152516265035 |
oct | 1523055066545 |
9 | 356757880471 |
10 | 114231111013 |
11 | 44499536478 |
12 | 1a17b927031 |
13 | aa05c794a6 |
14 | 57590d78c5 |
15 | 2e887c01ad |
hex | 1a98b46d65 |
114231111013 has 4 divisors (see below), whose sum is σ = 114234323328. Its totient is φ = 114227898700.
The previous prime is 114231110971. The next prime is 114231111031. The reversal of 114231111013 is 310111132411.
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 a de Polignac number, because none of the positive numbers 2k-114231111013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114231112013) 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 3 ways as a sum of consecutive naturals, for example, 1552213 + ... + 1624138.
It is an arithmetic number, because the mean of its divisors is an integer number (28558580832).
Almost surely, 2114231111013 is an apocalyptic number.
It is an amenable number.
114231111013 is a deficient number, since it is larger than the sum of its proper divisors (3212315).
114231111013 is an equidigital number, since it uses as much as digits as its factorization.
114231111013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3212314.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 114231111013 its reverse (310111132411), we get a palindrome (424342243424).
The spelling of 114231111013 in words is "one hundred fourteen billion, two hundred thirty-one million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •