15230
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 27432
- Proper Divisor Sum (Aliquot Sum)
- 12202
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6088
- Möbius Function
- -1
- Radical
- 15230
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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 that contain as proper substrings every maximal prime power dividing them.at n=8A059401
- Form a conjugate partition of row with 1+1+1 in first row. all other rows are the union of their parents. a(n) = number of types of piles in the n-th row.at n=27A064480
- Interprimes which are of the form s*prime, s=10.at n=30A075285
- Number of coverings of {1..n} by translation and reflection of a single set.at n=9A096203
- Number of subsets A of {1,2,...,n} with |A+A| = |A-A|.at n=16A118544
- Number of 0..n arrays x(0..10) of 11 elements with zero 6th differences.at n=30A200447
- Numbers n such that in Collatz (3x+1) trajectory of n, the number of terms < n equals number of terms > n.at n=34A217731
- Number of (n+1) X (1+1) 0..4 arrays with every 2 X 2 subblock having the sum of the absolute values of the edge differences equal to 8 and no adjacent elements equal.at n=3A233921
- Number of (n+1)X(4+1) 0..4 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 8 and no adjacent elements equal.at n=0A233924
- T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 8 and no adjacent elements equal.at n=6A233928
- T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock having the sum of the absolute values of the edge differences equal to 8 and no adjacent elements equal.at n=9A233928
- Number of sets of exactly five positive integers <= n having a square element sum.at n=29A281865
- Number of unlabeled digraphs with n arcs and a global source and sink.at n=9A350796