Base | Representation |
---|---|
bin | 110101001001010110… |
… | …0010100101100000111 |
3 | 101220120221012000200112 |
4 | 1222102230110230013 |
5 | 3332214320223221 |
6 | 124233011103235 |
7 | 11150153024141 |
oct | 1522254245407 |
9 | 356527160615 |
10 | 114130242311 |
11 | 44447601308 |
12 | 1a151ba1b1b |
13 | a9bb0c0477 |
14 | 574995bc91 |
15 | 2e7e9e815b |
hex | 1a92b14b07 |
114130242311 has 4 divisors (see below), whose sum is σ = 114130995000. Its totient is φ = 114129489624.
The previous prime is 114130242293. The next prime is 114130242323. The reversal of 114130242311 is 113242031411.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114130242311 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 (114130242341) 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 3 ways as a sum of consecutive naturals, for example, 60596 + ... + 481593.
It is an arithmetic number, because the mean of its divisors is an integer number (28532748750).
Almost surely, 2114130242311 is an apocalyptic number.
114130242311 is a deficient number, since it is larger than the sum of its proper divisors (752689).
114130242311 is an equidigital number, since it uses as much as digits as its factorization.
114130242311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 752688.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 114130242311 its reverse (113242031411), we get a palindrome (227372273722).
The spelling of 114130242311 in words is "one hundred fourteen billion, one hundred thirty million, two hundred forty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •