Base | Representation |
---|---|
bin | 11010000111010101… |
… | …00100010101100001 |
3 | 1100012002100121120011 |
4 | 31003222210111201 |
5 | 212203123243431 |
6 | 10235112044521 |
7 | 1004301113641 |
oct | 150352442541 |
9 | 40162317504 |
10 | 14020134241 |
11 | 5a45000403 |
12 | 2873393741 |
13 | 142583b429 |
14 | 970038521 |
15 | 570cadcb1 |
hex | 343aa4561 |
14020134241 has 4 divisors (see below), whose sum is σ = 14028417172. Its totient is φ = 14011851312.
The previous prime is 14020134229. The next prime is 14020134253. The reversal of 14020134241 is 14243102041.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (14020134229) and next prime (14020134253).
It can be written as a sum of positive squares in 2 ways, for example, as 5866947216 + 8153187025 = 76596^2 + 90295^2 .
It is a cyclic number.
It is not a de Polignac number, because 14020134241 - 27 = 14020134113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14020134281) 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, 4138926 + ... + 4142311.
It is an arithmetic number, because the mean of its divisors is an integer number (3507104293).
Almost surely, 214020134241 is an apocalyptic number.
It is an amenable number.
14020134241 is a deficient number, since it is larger than the sum of its proper divisors (8282931).
14020134241 is an equidigital number, since it uses as much as digits as its factorization.
14020134241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8282930.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 14020134241 its reverse (14243102041), we get a palindrome (28263236282).
The spelling of 14020134241 in words is "fourteen billion, twenty million, one hundred thirty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •