14567
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16656
- Proper Divisor Sum (Aliquot Sum)
- 2089
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12480
- Möbius Function
- 1
- Radical
- 14567
- Omega Function (Ω)
- 2
- 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
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Decimal part of a(n)^(1/2) starts with a 'nine digits' anagram.at n=6A034277
- Number of binary strings u of any length with property that length(u) + number of 0's in u <= n (only one of a string and its reversal are counted).at n=19A066067
- a(1) = 1; then the smallest number such that both the forward and reverse n-th partial concatenation is a prime for n > 1. (Reverse concatenation is taken term-wise and not digit-wise.)at n=33A083992
- Numerator of Hermite(n, 7/8).at n=5A159028
- Append three digits, each increasing by one modulo 10 from the last digit of the nonnegative integers. 0 -> 123, 1 -> 1234 2 -> 2345, ... , 9 -> 9012, 10 -> 10123, etc.at n=14A167231
- T(n,k)=Number of nXk 0..1 arrays with exactly floor(nXk/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=47A222769
- Number of 3Xn 0..1 arrays with exactly floor(3Xn/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=7A222771
- Numbers k such that k and k+1 have the same binary XOR of divisors.at n=30A227443
- k such that either 2^k + k - 3 or 2^k + k - 2 is prime.at n=18A237816
- Lengths of complete iterations (direct and reverse branches) of the Kolakoski sequence A000002.at n=38A249508
- Numbers k such that 477*2^k+1 is prime.at n=30A319487
- Array read by antidiagonals: A(n,k) is the number of nonnegative integer matrices with k columns and any number of distinct nonzero rows with column sums n.at n=42A331568
- Number of nonnegative integer matrices with 2 columns and any number of distinct nonzero rows with column sums n.at n=6A331646
- Lexicographically earliest sequence of nonnegative integers such that two distinct terms differ by at least 4 decimal digits.at n=14A346000
- a(n) = 4*a(n-1) - n - 1, for n > 0, a(0) = 1.at n=8A350717