15956
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 27930
- Proper Divisor Sum (Aliquot Sum)
- 11974
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7976
- Möbius Function
- 0
- Radical
- 7978
- 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
- 53
- 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
- yes
- Odd
- no
Appears in sequences
- Number of permutations p on the set [n] with the properties that abs(p(i)-i) <= 3 for all i and p(1) <= 3.at n=10A002527
- Floor[ prime(n)^{prime(n)/n}], prime(n) = A000040(n).at n=10A093862
- Matrix square of triangle A104980.at n=50A104988
- a(n) = A255295(2^n-1).at n=7A255296
- Number of length 3 1..(n+1) arrays with every leading partial sum divisible by 2 or 3.at n=36A257065
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 54", based on the 5-celled von Neumann neighborhood.at n=7A270023
- Number of partitions of 2n into distinct parts whose bitwise XOR equals 0.at n=52A307506
- Number of n-step point-symmetrical self-avoiding walks on the square lattice.at n=16A323189
- Numbers n such that A324187(n) = 0.at n=16A324199
- Number of integer compositions of n with all distinct 0-prepended first differences.at n=21A389601