Base | Representation |
---|---|
bin | 110101000110001000… |
… | …0010000110111001111 |
3 | 101220022101221002110211 |
4 | 1222030100100313033 |
5 | 3332004142121221 |
6 | 124214151543251 |
7 | 11144401623013 |
oct | 1521420206717 |
9 | 356271832424 |
10 | 114022223311 |
11 | 443a1633007 |
12 | 1a12198ab27 |
13 | a9a18cc9b9 |
14 | 5739480543 |
15 | 2e752ac6e1 |
hex | 1a8c410dcf |
114022223311 has 4 divisors (see below), whose sum is σ = 114042377800. Its totient is φ = 114002068824.
The previous prime is 114022223309. The next prime is 114022223323. The reversal of 114022223311 is 113322220411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113322220411 = 21937 ⋅5165803.
It is a cyclic number.
It is not a de Polignac number, because 114022223311 - 21 = 114022223309 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 (114022229311) 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, 10068756 + ... + 10080073.
It is an arithmetic number, because the mean of its divisors is an integer number (28510594450).
Almost surely, 2114022223311 is an apocalyptic number.
114022223311 is a deficient number, since it is larger than the sum of its proper divisors (20154489).
114022223311 is an equidigital number, since it uses as much as digits as its factorization.
114022223311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20154488.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 114022223311 its reverse (113322220411), we get a palindrome (227344443722).
The spelling of 114022223311 in words is "one hundred fourteen billion, twenty-two million, two hundred twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •