Base | Representation |
---|---|
bin | 110110000001… |
… | …001111011101 |
3 | 222122110001100 |
4 | 312001033131 |
5 | 12111121421 |
6 | 1223303313 |
7 | 231236211 |
oct | 66011735 |
9 | 28573040 |
10 | 14160861 |
11 | 7aa22a0 |
12 | 48aab39 |
13 | 2c1a710 |
14 | 1c48941 |
15 | 139ac26 |
hex | d813dd |
14160861 has 24 divisors (see below), whose sum is σ = 24032736. Its totient is φ = 7921440.
The previous prime is 14160859. The next prime is 14160877. The reversal of 14160861 is 16806141.
14160861 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14160861 - 21 = 14160859 is a prime.
It is a super-2 number, since 2×141608612 = 401059968522642, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14160851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4215 + ... + 6788.
It is an arithmetic number, because the mean of its divisors is an integer number (1001364).
Almost surely, 214160861 is an apocalyptic number.
14160861 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14160861 is a deficient number, since it is larger than the sum of its proper divisors (9871875).
14160861 is a wasteful number, since it uses less digits than its factorization.
14160861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11033 (or 11030 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
The square root of 14160861 is about 3763.0919467906. The cubic root of 14160861 is about 241.9338035823.
The spelling of 14160861 in words is "fourteen million, one hundred sixty thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •