15387
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21504
- Proper Divisor Sum (Aliquot Sum)
- 6117
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9768
- Möbius Function
- -1
- Radical
- 15387
- 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
- 115
- 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
- Positive numbers k such that k and 2*k are anagrams in base 9 (written in base 9).at n=26A023079
- Zeisel numbers.at n=6A051015
- Expansion of (1-x)/(1+x-x^2-2*x^3).at n=36A078041
- Number of primes with number of 1-bits <= number of 0-bits (A095075) in range ]2^n,2^(n+1)].at n=18A095055
- Number of A095287-primes in range ]2^n,2^(n+1)].at n=18A095297
- Number of partitions of n having no parts with multiplicity 5.at n=36A184640
- Position of 5^n in A051037 (5-smooth numbers).at n=29A188427
- Composite squarefree numbers n such that p-tau(n) divides n+phi(n), where p are the prime factors of n, tau(n) = A000005(n) and phi(n) = A000010(n).at n=15A229321
- Positions of 3's in A234323.at n=28A234804
- Antidiagonal-sums of absolute value of the array A377038(n,k) = n-th term of k-th differences of squarefree numbers (A005117).at n=16A377040