15226
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23904
- Proper Divisor Sum (Aliquot Sum)
- 8678
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7260
- Möbius Function
- -1
- Radical
- 15226
- 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
- yes
- 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
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=45A000125
- Convolution of natural numbers with composite numbers.at n=36A023539
- Numbers k such that 153*2^k+1 is prime.at n=22A032453
- Numbers k not ending in 0 such that for some base b, k_b is the reverse of k_10 (where k_b denotes k written in base b).at n=45A034294
- a(n)-th prime is the smallest prime containing exactly n 6's.at n=4A037064
- a(n) = n*(n+1)*(n^2+5*n+18)/24.at n=22A051744
- Start with a single triangle; at n-th generation add a triangle at each vertex, allowing triangles to overlap; sequence gives total population of triangles at n-th generation.at n=19A061777
- Third row of Pascal-(1,4,1) array A081579.at n=35A081587
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=59A090495
- a(n) = (4*n^3 + 6*n^2 + 8*n + 6)/3.at n=22A100504
- Numbers whose base-10 and base-7 representations are permutations of the same multiset of digits.at n=30A130604
- Integers k such that all the digits needed to write the consecutive nonnegative integers from 0 to k fill exactly a square (no holes, no overlaps).at n=46A158022
- Decimal numbers n which, when converted to a lower number base, show the reversed digits of n.at n=13A162572
- Number of sequences of n integers p(i) i=0..n-1 with 0<=p(i)<=7*i and |p(i)-p(i-1)|<=7.at n=4A180903
- Sum_{0<j<k<=n} P(k)-P(j), where P(j)=A065091(j) is the j-th odd prime.at n=26A206803
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 494", based on the 5-celled von Neumann neighborhood.at n=34A272548
- Number of n X n 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors.at n=3A283685
- Number of nX4 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors.at n=3A283687
- T(n,k) = Number of n X k 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors.at n=24A283691
- Number of 4Xn 0..1 arrays with no 1 equal to more than two of its horizontal, diagonal and antidiagonal neighbors.at n=3A283694