14067
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20880
- Proper Divisor Sum (Aliquot Sum)
- 6813
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9360
- Möbius Function
- 0
- Radical
- 1563
- 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
- 107
- 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) = floor(n*phi^13), where phi is the golden ratio, A001622.at n=27A004928
- a(n) = round(n*phi^13), where phi is the golden ratio, A001622.at n=27A004948
- Numbers having four 3's in base 8.at n=21A043436
- Ninth convolution of Schroeder's (second problem) numbers A001003(n), n>=0.at n=5A111997
- Positions of records in A110566.at n=18A112809
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (0, 1), (1, -1)}.at n=11A151257
- Numbers k such that (4*10^k - 19)/3 is prime.at n=19A289081
- Numbers k such that (8*10^k - 611)/9 is prime.at n=13A295399
- Numbers n such that there are precisely 5 groups of orders n and n + 1.at n=36A295991
- Number of nX6 0..1 arrays with every element unequal to 0, 1, 2 or 5 king-move adjacent elements, with upper left element zero.at n=6A303959
- Number of nX7 0..1 arrays with every element unequal to 0, 1, 2 or 5 king-move adjacent elements, with upper left element zero.at n=5A303960
- Coefficient of x^n in the expansion of 1/( (1-x) * (1-x^3) )^n.at n=8A370272
- a(n) = Sum_{k=0..4} 2^k * binomial(n,k).at n=13A389545