14832
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
- 30
- Divisor Sum
- 41912
- Proper Divisor Sum (Aliquot Sum)
- 27080
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4896
- Möbius Function
- 0
- Radical
- 618
- Omega Function (Ω)
- 7
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 120
- Smith Number
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Rencontres numbers: number of permutations of [n] with exactly one fixed point.at n=7A000240
- Triangle T(n,k) of rencontres numbers (number of permutations of n elements with k fixed points).at n=37A008290
- Triangle of rencontres numbers.at n=22A008291
- a(n) = floor( n! / e ).at n=7A014508
- a(n) = n*(29*n - 1)/2.at n=32A022286
- Numbers n such that n and n+1 are differences between 2 positive cubes in at least one way.at n=17A038594
- Numbers ending with '2' that are the difference of two positive cubes.at n=34A038857
- (Sum of digits of n)^6 - (sum of digits^6 of n).at n=23A069966
- (Sum of digits of n)^6 - (sum of digits^6 of n).at n=32A069966
- Table T(n,k) giving number of ways of obtaining exactly one correct answer on an (n,k)-matching problem (1 <= k <= n).at n=35A076732
- Table (by antidiagonals) of labeled alternating octopuses with n black nodes and k white nodes. Each type of object labeled from its own label set.at n=24A091466
- Graham-Pollak sequence with initial term 5.at n=23A091522
- Triangle read by rows: T(n,k) = number of partial derangements, that is, the number of permutations of n distinct, ordered items in which exactly k of the items are in their natural ordered positions, for n >= 0, k = n, n-1, ..., 1, 0.at n=43A098825
- a(n)=4a(n-1)-4a(n-2)+2a(n-3).at n=10A099216
- a(n) = 5^n - 3^n - 2^n.at n=5A130072
- a(n) = 5^n - 3^n - 2^n.at n=6A135158
- Triangle read by rows: T(n,k) is the number of partial bijections (or subpermutations) of an n-element set of height k (height(alpha) = |Im(alpha)|) and with exactly 1 fixed point.at n=35A144090
- Triangle T(n, k) = binomial(n, k)*A000166(n-k)*k^n with T(0, 0) = 1, read by rows.at n=37A156788
- a(n) = 512*n - 16.at n=28A157447
- Triangle read by rows: T(n,k) is the number of non-derangements of {1,2,...,n} for which the difference between the largest and smallest fixed points is k (n>=1; 0 <= k <= n-1).at n=28A161129