15463
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 18056
- Proper Divisor Sum (Aliquot Sum)
- 2593
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12972
- Möbius Function
- 0
- Radical
- 329
- 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
- 133
- 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
- Molien series for complete weight enumerator of self-dual code over GF(5) containing all-1's vector.at n=18A028345
- Composite numbers whose prime factors contain no digits other than 4 and 7.at n=6A036318
- Numbers that are the product of 3 prime factors whose concatenation is a palindrome.at n=33A046452
- a(n) = (F(3n) + F(n))/3, where F = A000045 (the Fibonacci sequence).at n=8A049673
- Numbers k such that the squarefree part of k equals A062799(k).at n=27A069551
- Number of partitions of n such that the least part occurs exactly twice.at n=45A096373
- Numbers k such that sigma(k)*phi(k) is a palindrome.at n=10A115892
- Consider pairs m,n such that 1/(UnitarySigma(m))^(1/2)=1/(UnitarySigma(n))^(1/2)=k^(1/2)*(1/m^(1/2)-1/n^(1/2)), n<m. Sequence gives values of k.at n=2A144492
- Number of resistance values that can be constructed using up to n equal resistances by arranging them in an arbitrary series-parallel arrangement.at n=11A153588
- Number of nonempty subsets of {1, 2, ..., n} with <=9 pairwise coprime elements.at n=27A187270
- n for which A079277(n) + phi(n) < n.at n=16A208815
- 50k^2-40k-17 interleaved with 50k^2+10k+13 for k=>0.at n=36A217893
- Number of (n+1) X (4+1) 0..1 arrays with every 2 X 2 subblock antidiagonal maximum minus diagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal minimum nondecreasing vertically.at n=24A253393
- Coefficients in Molien series for 5-dimensional faithful representation of Horrocks-Mumford group G_{HM}.at n=36A258702
- Expansion of 1/(1-x-x^2+x^6+x^8-x^15) - 1/(1-x).at n=24A261666
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 345", based on the 5-celled von Neumann neighborhood.at n=28A271295
- Fully multiplicative with a(prime(k)) = Lucas(2*(k+1)) for k-th prime p, where Lucas(n) = A000032(n).at n=49A324900
- Numbers p^2*q, p > q odd primes such that q does not divide p-1, and q does not divide p+1.at n=29A350421
- Numbers k such that sigma(k) = psi(k) + tau(k) + omega(k).at n=13A386637
- Numbers k such that sigma(k) = psi(k) + omega(k)^3.at n=44A390252