Base | Representation |
---|---|
bin | 110101110111… |
… | …101011100101 |
3 | 222120110022222 |
4 | 311313223211 |
5 | 12103343301 |
6 | 1222402125 |
7 | 231014066 |
oct | 65675345 |
9 | 28513288 |
10 | 14121701 |
11 | 7a75930 |
12 | 4890345 |
13 | 2c05949 |
14 | 1c3856d |
15 | 138e31b |
hex | d77ae5 |
14121701 has 8 divisors (see below), whose sum is σ = 16075584. Its totient is φ = 12279520.
The previous prime is 14121689. The next prime is 14121727. The reversal of 14121701 is 10712141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14121701 - 210 = 14120677 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14121701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14121301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27656 + ... + 28161.
It is an arithmetic number, because the mean of its divisors is an integer number (2009448).
Almost surely, 214121701 is an apocalyptic number.
14121701 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14121701 is a deficient number, since it is larger than the sum of its proper divisors (1953883).
14121701 is a wasteful number, since it uses less digits than its factorization.
14121701 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55851.
The product of its (nonzero) digits is 56, while the sum is 17.
The square root of 14121701 is about 3757.8851765321. The cubic root of 14121701 is about 241.7105856499.
Adding to 14121701 its reverse (10712141), we get a palindrome (24833842).
It can be divided in two parts, 1412 and 1701, that added together give a palindrome (3113).
The spelling of 14121701 in words is "fourteen million, one hundred twenty-one thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •