Base | Representation |
---|---|
bin | 11010110101101001… |
… | …11101100101001101 |
3 | 1101012011120120122211 |
4 | 31122310331211031 |
5 | 214002114010203 |
6 | 10341433110421 |
7 | 1020030140626 |
oct | 153264754515 |
9 | 41164516584 |
10 | 14408735053 |
11 | 612439a9a9 |
12 | 2961558411 |
13 | 14881bb33b |
14 | 9a98b2a4d |
15 | 594e6ec6d |
hex | 35ad3d94d |
14408735053 has 2 divisors, whose sum is σ = 14408735054. Its totient is φ = 14408735052.
The previous prime is 14408735041. The next prime is 14408735093. The reversal of 14408735053 is 35053780441.
It is an a-pointer prime, because the next prime (14408735093) can be obtained adding 14408735053 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12293930884 + 2114804169 = 110878^2 + 45987^2 .
It is a cyclic number.
It is not a de Polignac number, because 14408735053 - 25 = 14408735021 is a prime.
It is a super-2 number, since 2×144087350532 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14408734997 and 14408735015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14408735093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7204367526 + 7204367527.
It is an arithmetic number, because the mean of its divisors is an integer number (7204367527).
Almost surely, 214408735053 is an apocalyptic number.
It is an amenable number.
14408735053 is a deficient number, since it is larger than the sum of its proper divisors (1).
14408735053 is an equidigital number, since it uses as much as digits as its factorization.
14408735053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 201600, while the sum is 40.
The spelling of 14408735053 in words is "fourteen billion, four hundred eight million, seven hundred thirty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •