15046
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 22572
- Proper Divisor Sum (Aliquot Sum)
- 7526
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7522
- Möbius Function
- 1
- Radical
- 15046
- Omega Function (Ω)
- 2
- 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
- 40
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Number of unlabeled unit interval graphs with n nodes.at n=10A005217
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 82 ones.at n=12A031850
- a(n) = C(n+2,3) + 2*C(n,2) + 2*(n-2).at n=41A034857
- Erroneous version of A005217.at n=9A092458
- Let M(n) be the n X n matrix m(i,j)=min(i,j) for 1<=i,j<=n then a(n) is the trace of M(n)^(-6).at n=17A114358
- Times in hours, minutes and seconds (to the nearest second) at which the hour and minute hands of an analog clock, if interchanged, continue to indicate some other albeit accurate times, over a complete 12-hour sweep for the slower hand. Leading zeros omitted.at n=22A121577
- Partial sums of A165271.at n=34A165273
- Number of binary words of length n with properties that there is no pair of adjacent 1's and no subword of the form X^4 for any string X.at n=26A170877
- Number of 3-step S, E, and NW-moving king's tours on an n X n board summed over all starting positions.at n=41A187508
- G.f. satisfies: A(x) = 1 + Sum_{n>=1} n * (x*A(x))^(n*(n+1)/2) / (1 - x^n*A(x)^n).at n=9A204218
- Numbers n such that n!10+1 is prime.at n=42A204656
- Number of partitions of n such that (greatest part) - (least part) = number of parts.at n=52A237832
- Numbers n such that floor((3/2)^n)-floor((3/2)^(n-1)) is a prime number.at n=28A243591
- Number of (n+2)X(1+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 or 4.at n=8A252068
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 3 or 4.at n=36A252075
- a(n) is the number of lattice walks from (0,0) to (3*n,3*n) that use steps in directions {(3,0), (2,1), (1,2), (0,3)} and stay weakly below the line y=x.at n=5A292437
- Anagrasum integers: integers N that exactly reproduce their set of digits when we form the set of sums of pairs of adjacent digits.at n=31A296521