14833
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
- 8
- Divisor Sum
- 18368
- Proper Divisor Sum (Aliquot Sum)
- 3535
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11664
- Möbius Function
- -1
- Radical
- 14833
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points.at n=8A000166
- Number of bipartite partitions.at n=13A002765
- Triangle T(n,k) of rencontres numbers (number of permutations of n elements with k fixed points).at n=36A008290
- Triangle of rencontres numbers.at n=21A008291
- Triangle read by rows: T(n,k) = number of permutations of [n] allowing i->i+j (mod n), j=0..k-1.at n=34A008305
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k consecutive ascending pairs (0 <= k <= n-1).at n=34A010027
- sec(sec(x)*arctan(x))=1+1/2!*x^2+9/4!*x^4+345/6!*x^6+14833/8!*x^8...at n=4A012812
- Strong pseudoprimes to base 53.at n=14A020279
- 8th differences of factorial numbers.at n=0A023045
- Triangle of numbers of permutations eliminating just k cards out of n in game of Mousetrap.at n=36A028305
- Triangle read by rows of numbers of permutations eliminating just card k out of n in game of Mousetrap.at n=36A028306
- Triangle read by rows of numbers of permutations eliminating just card k out of n in game of Mousetrap.at n=44A028306
- Numbers n such that n and n-1 are differences between 2 positive cubes in at least one way.at n=17A038595
- Numbers ending with '3' that are the difference of two positive cubes.at n=30A038858
- Triangular array formed from successive differences of factorial numbers.at n=44A047920
- Number of 3 X 3 matrices with elements from [0,...,(n-1)] satisfying the condition that the middle element of each row or column is the difference of the two end elements (in absolute value).at n=12A058333
- From Renyi's "beta expansion of 1 in base 3/2": sequence gives a(1), a(2), ... where x(n) = a(n)/2^n, with 0 < a(n) < 2^n, a(1) = 1, a(n) = 3*a(n-1) modulo 2^n.at n=14A058842
- Triangular array formed from successive differences of factorial numbers, then with factorials removed.at n=44A060475
- Triangle T[n,m]: T[n,-1] = 0; T[0,0] = 0; T[n,0] = n*n!; T[n,m] = T[n,m-1] - T[n-1,m-1].at n=35A061312
- Euler's difference table: triangle read by rows, formed by starting with factorial numbers (A000142) and repeatedly taking differences. T(n,n) = n!, T(n,k) = T(n,k+1) - T(n-1,k).at n=36A068106