14337
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
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21840
- Proper Divisor Sum (Aliquot Sum)
- 7503
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9396
- Möbius Function
- 0
- Radical
- 177
- Omega Function (Ω)
- 6
- 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
- 76
- 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
- Number of permutations of length n with longest increasing subsequence of length 3.at n=5A001454
- Numbers that are the sum of 8 positive 11th powers.at n=7A004819
- Numbers that are the sum of at most 8 positive 11th powers.at n=43A004914
- Triangle of numbers T(n,k) = number of permutations of (1,2,...,n) with longest increasing subsequence of length k (1<=k<=n).at n=30A047874
- Numbers n such that n | 9^n + 8^n + 1.at n=16A057296
- Numbers n such that n | 6^n + 5^n + 1.at n=17A057299
- Numbers n such that n | 11^n + 9^n + 7^n + 5^n + 3^n + 1.at n=23A057832
- Numbers n such that n | 8^n + 6^n + 4^n + 2^n + 1.at n=17A057840
- Numbers k such that the smoothly undulating palindromic number (73*10^k - 37)/99 is a prime.at n=4A062222
- Integer part of log(n^n)^(1 + log(log(1 + n))).at n=24A062479
- a(n) is the unique positive integer m which has a self-conjugate partition whose parts are the first n primes.at n=43A067773
- a(n) = 512*n + 1.at n=28A076338
- a(0) = 8; for n>0, a(n) = 2*a(n-1) - 1.at n=11A083686
- a(n) = 3*a(n-2) + 3*a(n-3), a(0)=1, a(1)=0, a(2)=3.at n=14A099094
- Duplicate of A099094.at n=14A099465
- Where records appear in A109734.at n=32A109740
- Triangle of numbers read by rows: T(n,k) = number of permutations sigma of (1,2,...,n) with n - {length of longest increasing subsequence in sigma} = k (0<=k<=n-1).at n=33A126065
- Binomial transform of 2^n, 2^n, 2^n.at n=12A137256
- Triangle T(n, k) = 2^(n+k-2)*prime(k) + (n mod 2) if k <= floor(n/2) otherwise 2^(2*n-k-2)*prime(n-k) + (n mod 2), with T(n, 0) = T(n, n) = 1, read by rows.at n=49A157192
- Triangle T(n, k) = 2^(n+k-2)*prime(k) + (n mod 2) if k <= floor(n/2) otherwise 2^(2*n-k-2)*prime(n-k) + (n mod 2), with T(n, 0) = T(n, n) = 1, read by rows.at n=50A157192