15222
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 31680
- Proper Divisor Sum (Aliquot Sum)
- 16458
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4872
- Möbius Function
- 1
- Radical
- 15222
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Odd
- no
Appears in sequences
- Numbers which contain exactly the same digits (with the correct multiplicity) in 3 different smaller bases.at n=25A059828
- Ulam's spiral (ENE spoke).at n=31A143856
- a(n) = floor(sqrt(2*n^5)).at n=41A172473
- O.g.f.: exp( Sum_{n>=1} A067692(n)*x^n/n ), where A067692(n) = [sigma(n)^2 + sigma(n,2)]/2.at n=14A180608
- Number of -2..2 arrays x(0..n-1) of n elements with sum zero and with zeroth through n-1st differences all nonzero.at n=10A200032
- Triangle of coefficients of polynomials v(n,x) jointly generated with A207625; see the Formula section.at n=58A207626
- Main diagonal starting k=2 of array A(k,n) = numbers n such that n^k - prime(n) is a prime.at n=40A213477
- Number of partitions p of n such that the m(M(p)) is a part, where m = multiplicity, M = the minimum multiplicity of the parts of p.at n=40A240539
- Capless binary boundary codes for holeless strictly non-overlapping polyhexes, only the maximal representative from each equivalence class obtained by rotating.at n=4A258004
- Capless binary boundary codes for fusenes, maximal representative from each equivalence class up to rotation.at n=4A258014
- Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00010101 or 01010101.at n=15A259735
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 214", based on the 5-celled von Neumann neighborhood.at n=34A270907
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 505", based on the 5-celled von Neumann neighborhood.at n=26A272583
- Number of minimal edge covers in the n-dipyramidal graph.at n=9A297713
- Number of nX3 0..1 arrays with every element equal to 1, 2, 4 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=9A300634
- a(n) is the number of tuples (t_1, ..., t_n) with integers 2 <= t_1 <= ... <= t_n such that Product_{i = 1..n} (3 + 1/t_i) is an integer.at n=3A355626