15273
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 22074
- Proper Divisor Sum (Aliquot Sum)
- 6801
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10176
- Möbius Function
- 0
- Radical
- 5091
- Omega Function (Ω)
- 3
- 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
- 146
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of ( 1-x ) / ( 1-3*x+x^2-x^3+x^4 ).at n=10A052985
- Integer part of log(n!)^(1 + log(log(1 + n))).at n=29A062475
- Nearest integer to log(n!)^(1 + log(log(1 + n))).at n=29A062476
- a(1) = 16; a(n+1) = sum of a(n) and (a(n) written in base 2 and reversed).at n=13A070869
- Expansion of 1/((1-x)*(1+x+x^2+2*x^3)).at n=36A077909
- Integers k such that 10^k + 87 is a prime number.at n=10A135117
- a(n) = 12*n^2 - 8*n + 9.at n=35A167585
- Number of nX3 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=6A208429
- Number of nX7 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=2A208433
- T(n,k)=Number of nXk 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=38A208434
- T(n,k)=Number of nXk 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=42A208434
- Number of nondecreasing sequences of 5 1..n integers with no element dividing the sequence sum.at n=18A212872
- Number of partitions of n such that m(2) = m(3), where m = multiplicity.at n=44A240064
- G.f. satisfies: A(x) = 1 - x + A(x)^3 - A(x*A(x)^5).at n=5A242009
- a(n) = (4*n^3 - 6*n^2 + 14*n + 3)/3.at n=23A321124
- Numbers k such that 30*k - 1, 30*k + 1, 30*k^2 - 1 and 30*k^2 + 1 are all prime.at n=26A359184
- a(n) = Sum_{(n - k) does not divide n, 0 <= k < n} k^2.at n=42A367327
- Number of ways to place eight distinct positive integers on a square, four on the corners and four on the sides such that the sum of the three values on each side is n.at n=25A380962