15484
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 31920
- Proper Divisor Sum (Aliquot Sum)
- 16436
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6552
- Möbius Function
- 0
- Radical
- 1106
- Omega Function (Ω)
- 5
- 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
- 115
- 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
- yes
- Odd
- no
Appears in sequences
- Even heptagonal numbers (A000566).at n=39A014640
- a(n) = C(4*n,n) - C(4*n,n-4).at n=5A026033
- a(n) = (2*n + 1)*(5*n + 1).at n=39A033571
- Largest coefficient in expansion of Product (1+q^1+q^3...+q^(2i-1)), i=1 to n.at n=7A039831
- Denominator of (prime(n)+1)*(prime(n+1)+1)/(4*(prime(n)*prime(n+1)+1)).at n=39A079082
- Structured small rhombicubeoctahedral numbers.at n=13A100149
- Structured meta-prism numbers, the n-th number from a structured n-gonal prism number sequence.at n=13A100177
- Heptagonal numbers divisible by 7.at n=23A117795
- Triangle read by rows: T(n,k) is the number of unlabeled acyclic digraphs with n >= 0 nodes and n-k outnodes (0 <= k <= n).at n=32A122078
- a(n) = ( (7 + sqrt(7))^n - (7 - sqrt(7))^n )/(2*sqrt(7)).at n=4A154248
- Number of n X n X n triangular nonnegative integer arrays with all sums of an element and its neighbors <= 11.at n=3A166183
- Number of 3 X 3 X 3 triangular nonnegative integer arrays with all sums of an element and its neighbors <= n.at n=11A166189
- Expansion of 1/(1 - x^5 - x^6 - x^7 - x^8 + x^13).at n=55A173924
- Number of nondecreasing arrangements of n numbers in -3..3 with sum zero and sum of squares not greater than n*12/3.at n=27A183921
- Number of ways to place 2 nonattacking nightriders on an n X n cylindrical board.at n=13A196810
- Number of 0..n arrays x(0..3) of 4 elements without any interior element greater than both neighbors.at n=12A200887
- Sophie Germain 5-almost primes.at n=28A211162
- Number of cyclotomic cosets of 9 mod 10^n.at n=31A220020
- The number of permutations of length n that can be sorted by 3 block transpositions.at n=7A228393
- Number T(n,k) of equivalence classes of ways of placing k 3 X 3 tiles in an n X 7 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=3, 0<=k<=2*floor(n/3), read by rows.at n=59A238556