Base | Representation |
---|---|
bin | 11010010101110010… |
… | …01101001010101101 |
3 | 1100111112120011101111 |
4 | 31022321031022231 |
5 | 212430200141023 |
6 | 10255123312021 |
7 | 1010303006311 |
oct | 151271151255 |
9 | 40445504344 |
10 | 14141412013 |
11 | 5aa7505173 |
12 | 28a7b1b611 |
13 | 14449c1b21 |
14 | 9821a7b41 |
15 | 57b76800d |
hex | 34ae4d2ad |
14141412013 has 4 divisors (see below), whose sum is σ = 14629046940. Its totient is φ = 13653777088.
The previous prime is 14141411993. The next prime is 14141412059. The reversal of 14141412013 is 31021414141.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31021414141 = 33809 ⋅917549.
It can be written as a sum of positive squares in 2 ways, for example, as 2766549604 + 11374862409 = 52598^2 + 106653^2 .
It is a cyclic number.
It is not a de Polignac number, because 14141412013 - 225 = 14107857581 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14141410013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 243817420 + ... + 243817477.
It is an arithmetic number, because the mean of its divisors is an integer number (3657261735).
Almost surely, 214141412013 is an apocalyptic number.
It is an amenable number.
14141412013 is a deficient number, since it is larger than the sum of its proper divisors (487634927).
14141412013 is an equidigital number, since it uses as much as digits as its factorization.
14141412013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 487634926.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 14141412013 its reverse (31021414141), we get a palindrome (45162826154).
The spelling of 14141412013 in words is "fourteen billion, one hundred forty-one million, four hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •