Base | Representation |
---|---|
bin | 11010000101100010… |
… | …10001000011010001 |
3 | 1100011001002110100102 |
4 | 31002301101003101 |
5 | 212140302104131 |
6 | 10233414102145 |
7 | 1004026332233 |
oct | 150261210321 |
9 | 40131073312 |
10 | 14005113041 |
11 | 5a37580797 |
12 | 286a34a955 |
13 | 14226ac24a |
14 | 96c048253 |
15 | 56e7e31cb |
hex | 342c510d1 |
14005113041 has 2 divisors, whose sum is σ = 14005113042. Its totient is φ = 14005113040.
The previous prime is 14005113019. The next prime is 14005113079. The reversal of 14005113041 is 14031150041.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8964113041 + 5041000000 = 94679^2 + 71000^2 .
It is an emirp because it is prime and its reverse (14031150041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14005113041 - 214 = 14005096657 is a prime.
It is a super-2 number, since 2×140051130412 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14005113641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7002556520 + 7002556521.
It is an arithmetic number, because the mean of its divisors is an integer number (7002556521).
Almost surely, 214005113041 is an apocalyptic number.
It is an amenable number.
14005113041 is a deficient number, since it is larger than the sum of its proper divisors (1).
14005113041 is an equidigital number, since it uses as much as digits as its factorization.
14005113041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 14005113041 its reverse (14031150041), we get a palindrome (28036263082).
The spelling of 14005113041 in words is "fourteen billion, five million, one hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •