Base | Representation |
---|---|
bin | 110101001100000111… |
… | …0111110001011100001 |
3 | 101220211102010100001221 |
4 | 1222120032332023201 |
5 | 3332412120224413 |
6 | 124250131455041 |
7 | 11152362163435 |
oct | 1523016761341 |
9 | 356742110057 |
10 | 114223211233 |
11 | 4449503022a |
12 | 1a179157481 |
13 | aa04441871 |
14 | 575803c9c5 |
15 | 2e87c5e68d |
hex | 1a983be2e1 |
114223211233 has 8 divisors (see below), whose sum is σ = 115962641280. Its totient is φ = 112487410560.
The previous prime is 114223211231. The next prime is 114223211243. The reversal of 114223211233 is 332112322411.
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 114223211233 - 21 = 114223211231 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114223211198 and 114223211207.
It is not an unprimeable number, because it can be changed into a prime (114223211231) 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, 843888 + ... + 969841.
It is an arithmetic number, because the mean of its divisors is an integer number (14495330160).
Almost surely, 2114223211233 is an apocalyptic number.
It is an amenable number.
114223211233 is a deficient number, since it is larger than the sum of its proper divisors (1739430047).
114223211233 is an equidigital number, since it uses as much as digits as its factorization.
114223211233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1814687.
The product of its digits is 1728, while the sum is 25.
Adding to 114223211233 its reverse (332112322411), we get a palindrome (446335533644).
The spelling of 114223211233 in words is "one hundred fourteen billion, two hundred twenty-three million, two hundred eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •