Base | Representation |
---|---|
bin | 1110111101000101… |
… | …1000101100011111 |
3 | 101100202122012010111 |
4 | 3233101120230133 |
5 | 31210130442343 |
6 | 1502200350451 |
7 | 201323043115 |
oct | 35721305437 |
9 | 11322565114 |
10 | 4014312223 |
11 | 177aa7a209 |
12 | 940475427 |
13 | 4bc892c9c |
14 | 2a11dbab5 |
15 | 187650c9d |
hex | ef458b1f |
4014312223 has 2 divisors, whose sum is σ = 4014312224. Its totient is φ = 4014312222.
The previous prime is 4014312209. The next prime is 4014312283. The reversal of 4014312223 is 3222134104.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4014312223 - 221 = 4012215071 is a prime.
It is a super-2 number, since 2×40143122232 = 32229405247454403458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4014312194 and 4014312203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4014312283) 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 as a sum of consecutive naturals, namely, 2007156111 + 2007156112.
It is an arithmetic number, because the mean of its divisors is an integer number (2007156112).
Almost surely, 24014312223 is an apocalyptic number.
4014312223 is a deficient number, since it is larger than the sum of its proper divisors (1).
4014312223 is an equidigital number, since it uses as much as digits as its factorization.
4014312223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 4014312223 is about 63358.6002291717. The cubic root of 4014312223 is about 1589.2920681917.
Adding to 4014312223 its reverse (3222134104), we get a palindrome (7236446327).
The spelling of 4014312223 in words is "four billion, fourteen million, three hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •