Base | Representation |
---|---|
bin | 110101001000110111… |
… | …1100111111100110110 |
3 | 101220112211020121200022 |
4 | 1222101233213330312 |
5 | 3332201232033142 |
6 | 124231242045142 |
7 | 11146600542611 |
oct | 1522157477466 |
9 | 356484217608 |
10 | 114114330422 |
11 | 44439623494 |
12 | 1a1487a97b2 |
13 | a9b7a0ba51 |
14 | 57477b9178 |
15 | 2e7d4036d2 |
hex | 1a91be7f36 |
114114330422 has 8 divisors (see below), whose sum is σ = 174401146656. Its totient is φ = 55980614872.
The previous prime is 114114330401. The next prime is 114114330427. The reversal of 114114330422 is 224033411411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1141143304222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114114330391 and 114114330400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114114330427) 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 3 ways as a sum of consecutive naturals, for example, 538275038 + ... + 538275249.
It is an arithmetic number, because the mean of its divisors is an integer number (21800143332).
Almost surely, 2114114330422 is an apocalyptic number.
114114330422 is a deficient number, since it is larger than the sum of its proper divisors (60286816234).
114114330422 is a wasteful number, since it uses less digits than its factorization.
114114330422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1076550342.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 114114330422 its reverse (224033411411), we get a palindrome (338147741833).
The spelling of 114114330422 in words is "one hundred fourteen billion, one hundred fourteen million, three hundred thirty thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •