14063
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16800
- Proper Divisor Sum (Aliquot Sum)
- 2737
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11760
- Möbius Function
- 0
- Radical
- 287
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 45
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = n*(n+1)*(n+8)/6.at n=41A006503
- Expansion of 1/(1-x^4-x^5-x^6-x^7-x^8).at n=40A017830
- Positive numbers k such that k and 2*k are anagrams in base 8 (written in base 8).at n=25A023073
- Positive numbers k such that k and 4*k are anagrams in base 8 (written in base 8).at n=13A023075
- Numbers k that divide 8^k + 7^k + 6^k + 5^k + 4^k + 3^k + 2^k.at n=32A057490
- Numbers n such that n | 8^n + 6^n + 4^n + 2^n + 1.at n=16A057840
- Consider sequence of fractions A066657/A066658 produced by ratios of terms in A066720; let m = smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A066720(m) = k; sequence gives values of m; set a(n) = -1 if some fraction i/n never appears.at n=22A066849
- Numbers k such that prime(k+2)-(k+2)*tau(k+2) = prime(k-2)-(k-2)*tau(k-2) where tau(k) = A000005(k) is the number of divisors of k.at n=40A067354
- Engel expansion of Gamma(1/4)=3.62560990822190831193...at n=8A068479
- a(n) is the difference between the largest and smallest integer solutions to n=x/pi(x), where pi(x) = A000720(x).at n=47A087236
- Numbers n such that A001414(n) = sum of squared digits of n.at n=28A094908
- Positive numbers y such that y^2 is of the form x^2+(x+16807)^2 with integer x.at n=3A156713
- Number of binary strings of length n with no substrings equal to 0001 0101 or 1110.at n=20A164475
- Dispersion of A016873, (5k+3), by antidiagonals.at n=39A191705
- (9*5^n+1)/2.at n=5A199312
- Number of -5..5 arrays of n elements with first, second and third differences also in -5..5.at n=4A202121
- T(n,k) is the number of -k..k arrays of n elements with first, second and third differences also in -k..k.at n=40A202124
- Number of -n..n arrays of 5 elements with first, second and third differences also in -n..n.at n=4A202126
- n - (sum of prime factors of n^2+1) is a positive square.at n=39A216896
- 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=39A234691