14888
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 27930
- Proper Divisor Sum (Aliquot Sum)
- 13042
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7440
- Möbius Function
- 0
- Radical
- 3722
- 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
- 40
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 61.at n=23A031559
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 61.at n=1A031739
- Taylor series of 1/f(x) with recursively defined function f(x) from A109087.at n=18A109088
- a(n) is the concatenation, in ascending order, of the set of digits 1,2,4,8 whose sum equals the n-th prime using a minimal number of digits.at n=9A166745
- Number of ways to place 3 nonattacking zebras on an n X n board.at n=6A172138
- Fundamental discriminants of real quadratic number fields with class number 10.at n=38A218160
- Number of nX4 0..1 arrays with every element equal to 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=6A297989
- Number of nX7 0..1 arrays with every element equal to 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=3A297992
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=48A297993
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero.at n=51A297993
- a(n) = a(n-1) + a(n-2) + a([n/2]) + a([n/3]) + ... + a([n/n]), where a(0) = 1, a(1) = 2, a(2) = 3.at n=16A298357
- Number of nX7 0..1 arrays with every element equal to 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=3A298652
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=48A298653
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=51A298653
- Number of nX7 0..1 arrays with every element equal to 1, 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A298845
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=48A298846
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=51A298846
- Number of nX7 0..1 arrays with every element equal to 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A299606
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=48A299607
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=51A299607