14383
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15160
- Proper Divisor Sum (Aliquot Sum)
- 777
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13608
- Möbius Function
- 1
- Radical
- 14383
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 195
- 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
- Pseudoprimes to base 3.at n=26A005935
- Pseudoprimes to base 28.at n=40A020156
- Pseudoprimes to base 84.at n=33A020212
- Strong pseudoprimes to base 9.at n=18A020235
- Strong pseudoprimes to base 81.at n=25A020307
- Strong pseudoprimes to base 84.at n=10A020310
- In ternary expansion of n, reading from left to right, digits occur in order ...,0,1,2,0,1,2,...at n=18A037079
- Base 3 digits are, in order, the first n terms of the periodic sequence with initial period 2,0,1.at n=8A037512
- Bessel function Y_0(n) is a monotonically decreasing positive sequence.at n=28A046961
- Nonprimes k such that 3^k == 3 (mod k).at n=34A122780
- Values of n associated with A123728.at n=4A123729
- Numbers X such that (X+19)^3-X^3 is a square.at n=1A145122
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, 1, -1), (1, 0, 0), (1, 1, 0)}.at n=8A150077
- Terms of A122780 which are not Carmichael numbers A002997.at n=26A153514
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (n^2 +n -1)*T(n-2, k-1), read by rows.at n=38A154233
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (n^2 +n -1)*T(n-2, k-1), read by rows.at n=42A154233
- Numerator of Euler(n, 3/25).at n=3A156967
- Number of length 2+3 0..n arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth.at n=17A248539
- Euler pseudoprimes to base 9: composite integers such that abs(9^((n - 1)/2)) == 1 mod n.at n=33A263239
- Numbers k such that 4*10^k - 71 is prime.at n=16A294917