Base | Representation |
---|---|
bin | 11010001001111111… |
… | …00000110111001101 |
3 | 1100020122020221112100 |
4 | 31010333200313031 |
5 | 212224323333003 |
6 | 10241225225313 |
7 | 1004661310155 |
oct | 150477406715 |
9 | 40218227470 |
10 | 14042402253 |
11 | 5a5662a720 |
12 | 287a932239 |
13 | 142a336c79 |
14 | 972d93765 |
15 | 572c0bba3 |
hex | 344fe0dcd |
14042402253 has 12 divisors (see below), whose sum is σ = 22127421888. Its totient is φ = 8510546760.
The previous prime is 14042402251. The next prime is 14042402329. The reversal of 14042402253 is 35220424041.
14042402253 is a `hidden beast` number, since 1 + 4 + 0 + 4 + 2 + 402 + 253 = 666.
It is not a de Polignac number, because 14042402253 - 21 = 14042402251 is a prime.
It is a super-2 number, since 2×140424022532 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14042402251) 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 11 ways as a sum of consecutive naturals, for example, 70921125 + ... + 70921322.
It is an arithmetic number, because the mean of its divisors is an integer number (1843951824).
Almost surely, 214042402253 is an apocalyptic number.
It is an amenable number.
14042402253 is a deficient number, since it is larger than the sum of its proper divisors (8085019635).
14042402253 is a wasteful number, since it uses less digits than its factorization.
14042402253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141842464 (or 141842461 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 27.
Adding to 14042402253 its reverse (35220424041), we get a palindrome (49262826294).
The spelling of 14042402253 in words is "fourteen billion, forty-two million, four hundred two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •