Base | Representation |
---|---|
bin | 110101111010… |
… | …111100111101 |
3 | 222121010201021 |
4 | 311322330331 |
5 | 12104310401 |
6 | 1222544141 |
7 | 231101131 |
oct | 65727475 |
9 | 28533637 |
10 | 14135101 |
11 | 7a84a02 |
12 | 4898051 |
13 | 2c0ba86 |
14 | 1c3d3c1 |
15 | 13932a1 |
hex | d7af3d |
14135101 has 8 divisors (see below), whose sum is σ = 14667008. Its totient is φ = 13608000.
The previous prime is 14135071. The next prime is 14135111. The reversal of 14135101 is 10153141.
14135101 is nontrivially palindromic in base 14.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a 5-Lehmer number, since φ(14135101) divides (14135101-1)5.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14135101 is a prime.
It is a deceptive number, since it divides R14135100.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14135111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5461 + ... + 7621.
It is an arithmetic number, because the mean of its divisors is an integer number (1833376).
Almost surely, 214135101 is an apocalyptic number.
It is an amenable number.
14135101 is a deficient number, since it is larger than the sum of its proper divisors (531907).
14135101 is a wasteful number, since it uses less digits than its factorization.
14135101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2403.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 14135101 is about 3759.6676714837. The cubic root of 14135101 is about 241.7870140708.
Adding to 14135101 its reverse (10153141), we get a palindrome (24288242).
The spelling of 14135101 in words is "fourteen million, one hundred thirty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •