15465
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24768
- Proper Divisor Sum (Aliquot Sum)
- 9303
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8240
- Möbius Function
- -1
- Radical
- 15465
- 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
- 208
- 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
- no
- Odd
- yes
Appears in sequences
- Number of unlabeled reduced unit interval graphs on n nodes.at n=14A005218
- McKay-Thompson series of class 40A for Monster.at n=49A058662
- Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.at n=18A084276
- A B3-sequence: a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the sums of any three terms are all distinct.at n=21A096772
- Triangle T, read by rows, where row n+1 of T = row n of matrix power T^(2n) with appended '1' for n>=0 with T(0,0)=1.at n=22A132610
- Column 1 of triangle A132610.at n=5A132612
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (1, -1, 1), (1, 1, -1), (1, 1, 0)}.at n=8A149458
- Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=17A192958
- Number of (w,x,y,z) with all terms in {1,...,n} and w+x+y=|x-y|+|y-z|.at n=39A212678
- Sequence of pairs k,g such that k*2^n-1, k*2^n-1+g, k*2^n-1+2*g, and k*2^n+3*g are four consecutive primes in arithmetic progression for the smallest odd k.at n=30A230699
- Number of set partitions of [n] into blocks with distinct element sums.at n=9A275780
- Number of rooted trees with n nodes such that two equals the maximal number of subtrees of the same size extending from the same node.at n=12A318817