Base | Representation |
---|---|
bin | 110101100011… |
… | …111110110101 |
3 | 222102100122112 |
4 | 311203332311 |
5 | 12043303023 |
6 | 1220540405 |
7 | 230226620 |
oct | 65437665 |
9 | 28370575 |
10 | 14041013 |
11 | 7a20248 |
12 | 4851705 |
13 | 2ba7cbc |
14 | 1c16db7 |
15 | 1375478 |
hex | d63fb5 |
14041013 has 4 divisors (see below), whose sum is σ = 16046880. Its totient is φ = 12035148.
The previous prime is 14041009. The next prime is 14041021. The reversal of 14041013 is 31014041.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31014041 = 151 ⋅205391.
It is a cyclic number.
It is not a de Polignac number, because 14041013 - 22 = 14041009 is a prime.
It is a super-3 number, since 3×140410133 (a number of 22 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14041003) 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, 1002923 + ... + 1002936.
It is an arithmetic number, because the mean of its divisors is an integer number (4011720).
Almost surely, 214041013 is an apocalyptic number.
It is an amenable number.
14041013 is a deficient number, since it is larger than the sum of its proper divisors (2005867).
14041013 is an equidigital number, since it uses as much as digits as its factorization.
14041013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2005866.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 14041013 is about 3747.1339714507. The cubic root of 14041013 is about 241.2493473633.
Adding to 14041013 its reverse (31014041), we get a palindrome (45055054).
The spelling of 14041013 in words is "fourteen million, forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.249 sec. • engine limits •