Base | Representation |
---|---|
bin | 110101000101110101… |
… | …0111101010111001111 |
3 | 101220021201112020221020 |
4 | 1222023222331113033 |
5 | 3331444141202421 |
6 | 124213202205223 |
7 | 11144222533146 |
oct | 1521352752717 |
9 | 356251466836 |
10 | 114012444111 |
11 | 44397063825 |
12 | 1a11a653813 |
13 | a99c8877a7 |
14 | 573805675d |
15 | 2e744c9dc6 |
hex | 1a8babd5cf |
114012444111 has 8 divisors (see below), whose sum is σ = 152055417264. Its totient is φ = 75988883520.
The previous prime is 114012444071. The next prime is 114012444151. The reversal of 114012444111 is 111444210411.
It is an interprime number because it is at equal distance from previous prime (114012444071) and next prime (114012444151).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114012444111 - 26 = 114012444047 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114012444151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4839430 + ... + 4862931.
It is an arithmetic number, because the mean of its divisors is an integer number (19006927158).
Almost surely, 2114012444111 is an apocalyptic number.
114012444111 is a deficient number, since it is larger than the sum of its proper divisors (38042973153).
114012444111 is an equidigital number, since it uses as much as digits as its factorization.
114012444111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9706281.
The product of its (nonzero) digits is 512, while the sum is 24.
Adding to 114012444111 its reverse (111444210411), we get a palindrome (225456654522).
The spelling of 114012444111 in words is "one hundred fourteen billion, twelve million, four hundred forty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •