Base | Representation |
---|---|
bin | 1110111101000111… |
… | …0100000101100111 |
3 | 101100202211220001001 |
4 | 3233101310011213 |
5 | 31210143040143 |
6 | 1502203014131 |
7 | 201324021202 |
oct | 35721640547 |
9 | 11322756031 |
10 | 4014424423 |
11 | 1780046539 |
12 | 94050a347 |
13 | 4bc902089 |
14 | 2a122a939 |
15 | 18767414d |
hex | ef474167 |
4014424423 has 2 divisors, whose sum is σ = 4014424424. Its totient is φ = 4014424422.
The previous prime is 4014424361. The next prime is 4014424451. The reversal of 4014424423 is 3244244104.
It is an a-pointer prime, because the next prime (4014424451) can be obtained adding 4014424423 to its sum of digits (28).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4014424423 - 229 = 3477553511 is a prime.
It is a super-2 number, since 2×40144244232 = 32231206895957765858, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4014424391 and 4014424400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4014424493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2007212211 + 2007212212.
It is an arithmetic number, because the mean of its divisors is an integer number (2007212212).
Almost surely, 24014424423 is an apocalyptic number.
4014424423 is a deficient number, since it is larger than the sum of its proper divisors (1).
4014424423 is an equidigital number, since it uses as much as digits as its factorization.
4014424423 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12288, while the sum is 28.
The square root of 4014424423 is about 63359.4856592129. The cubic root of 4014424423 is about 1589.3068749546.
Adding to 4014424423 its reverse (3244244104), we get a palindrome (7258668527).
The spelling of 4014424423 in words is "four billion, fourteen million, four hundred twenty-four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •