14061
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19360
- Proper Divisor Sum (Aliquot Sum)
- 5299
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9072
- Möbius Function
- -1
- Radical
- 14061
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 151
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of loopless rooted planar maps with 3 faces and n vertices and no isthmuses. Also a(n)=T(4,n-3), array T as in A049600.at n=40A006416
- Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3)=j^3+k^3, ordered by increasing i; sequence gives j values.at n=14A054206
- Centered 20-gonal (or icosagonal) numbers.at n=37A069133
- Numbers k such that k!! + 2^4 is prime.at n=22A076189
- First member of the Diophantine pair (m,k) that satisfies 6(m^2 + m) = k^2 + k: a(n) = m.at n=9A077288
- a(1)=1. For n>1, a(n) equals the smallest number > a(n-1) of the form a(k) U j U a(k) U j, where U represents concatenation (written in decimal) of the binary representation of the arguments, where 1<=k < n, and j = {0} or {1} or {}.at n=15A175336
- Decimal value of the bitmap of active segments in 7-segment display of the number n, variant 1: bits 0-6 refer to segments from top to bottom, left to right.at n=33A234691
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 113", based on the 5-celled von Neumann neighborhood.at n=6A270178
- Positive integers k such that k divides 13^k + 2.at n=5A333413
- The smallest positive number k such that the sum of the products of its digits when written in all bases 2 to n equals k, or -1 if no such number exists.at n=21A376860
- The smallest positive number k such that the sum of the products of its digits when written in all bases 2 to n equals k, or -1 if no such number exists.at n=22A376860