14963
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16128
- Proper Divisor Sum (Aliquot Sum)
- 1165
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13800
- Möbius Function
- 1
- Radical
- 14963
- 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
- 164
- 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
- Number of polygons that can be formed from n points on a circle, no two adjacent.at n=9A002816
- Least k such that Product_{i=1..k} (prime(i) + 1) >= n*Product_{i=1..k} prime(i).at n=12A072986
- Interprimes (A024675) which are of the form s*prime, s=13.at n=8A075288
- Numbers such that the sum of the factorials of the digits of the fourth power is a square.at n=24A126077
- a(n) = floor(2*(3/2)^n).at n=22A147788
- Number of -1..1 arrays of n elements with first and second differences also in -1..1.at n=13A201081
- (p^2 - 3)/2 for odd primes p.at n=38A243887
- Records in A098550.at n=39A248647
- Composite numbers whose sum of aliquot parts divides the sum of the aliquot parts of the numbers less than or equal to n and not relatively prime to n.at n=19A249109
- Values of A098550 where A098550(k)/k reaches a record high.at n=14A251415
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 525", based on the 5-celled von Neumann neighborhood.at n=24A272740
- Expansion of 1/(1 - Sum_{k = i^j, i>=1, j>=2} x^k).at n=28A282500
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) + 1, where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A295956
- Triangle T(n,k) read by rows: T(n,k) = the number of ways of seating n people around a table for the second time so that k pairs are maintained. Reflected and rotated sequences are counted as one.at n=55A326411
- Numbers that are the sum of eight fourth powers in seven or more ways.at n=29A345582
- Numbers that are the sum of eight fourth powers in exactly seven ways.at n=26A345839
- Array T(n,m) read by antidiagonals: In an n X m grid draw straight walls between cells, starting at a border, such that the resulting figure is connected and has only one-cell wide paths; T(n,m) is the number of solutions up to symmetries of the rectangle.at n=57A375861
- Array T(n,m) read by antidiagonals: In an n X m grid draw straight walls between cells, starting at a border, such that the resulting figure is connected and has only one-cell wide paths; T(n,m) is the number of solutions up to symmetries of the rectangle.at n=63A375861