Base | Representation |
---|---|
bin | 110101110100… |
… | …011001111001 |
3 | 222112202220221 |
4 | 311310121321 |
5 | 12102431111 |
6 | 1222220041 |
7 | 230630005 |
oct | 65643171 |
9 | 28482827 |
10 | 14108281 |
11 | 7a66840 |
12 | 4884621 |
13 | 2bcc7c5 |
14 | 1c33705 |
15 | 138a371 |
hex | d74679 |
14108281 has 4 divisors (see below), whose sum is σ = 15390864. Its totient is φ = 12825700.
The previous prime is 14108273. The next prime is 14108287. The reversal of 14108281 is 18280141.
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: 18280141 = 11 ⋅1661831.
It is a cyclic number.
It is not a de Polignac number, because 14108281 - 23 = 14108273 is a prime.
It is a super-2 number, since 2×141082812 = 398087185549922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14108287) 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, 641275 + ... + 641296.
It is an arithmetic number, because the mean of its divisors is an integer number (3847716).
Almost surely, 214108281 is an apocalyptic number.
14108281 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14108281 is a deficient number, since it is larger than the sum of its proper divisors (1282583).
14108281 is a wasteful number, since it uses less digits than its factorization.
14108281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1282582.
The product of its (nonzero) digits is 512, while the sum is 25.
The square root of 14108281 is about 3756.0991733446. The cubic root of 14108281 is about 241.6339946847.
The spelling of 14108281 in words is "fourteen million, one hundred eight thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.003 sec. • engine limits •