Base | Representation |
---|---|
bin | 110101001001000110… |
… | …1110000100111010111 |
3 | 101220120101002222011211 |
4 | 1222102031300213113 |
5 | 3332210242331411 |
6 | 124232123242251 |
7 | 11150024644252 |
oct | 1522215604727 |
9 | 356511088154 |
10 | 114122230231 |
11 | 44443029759 |
12 | 1a14b379387 |
13 | a9b95466a9 |
14 | 5748874099 |
15 | 2e7de64221 |
hex | 1a923709d7 |
114122230231 has 8 divisors (see below), whose sum is σ = 121330936800. Its totient is φ = 107100762912.
The previous prime is 114122230147. The next prime is 114122230241. The reversal of 114122230231 is 132032221411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114122230231 - 211 = 114122228183 is a prime.
It is a super-2 number, since 2×1141222302312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114122230241) 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 7 ways as a sum of consecutive naturals, for example, 46808556 + ... + 46810993.
It is an arithmetic number, because the mean of its divisors is an integer number (15166367100).
Almost surely, 2114122230231 is an apocalyptic number.
114122230231 is a deficient number, since it is larger than the sum of its proper divisors (7208706569).
114122230231 is an equidigital number, since it uses as much as digits as its factorization.
114122230231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93619625.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 114122230231 its reverse (132032221411), we get a palindrome (246154451642).
The spelling of 114122230231 in words is "one hundred fourteen billion, one hundred twenty-two million, two hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •