15929
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
- 4
- Divisor Sum
- 16884
- Proper Divisor Sum (Aliquot Sum)
- 955
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14976
- Möbius Function
- 1
- Radical
- 15929
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 97
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers n such that prime(n) mod n <= 10.at n=50A022465
- Numbers k such that prime(k) == 10 (mod k).at n=5A023152
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=41A034076
- Rhombi (in 3 different orientations) in a rhombus with 60-degree acute angles.at n=33A052153
- Numbers n such that n+1 divides prime(n)+1.at n=11A061437
- At stage 1, start with a unit equilateral equiangular triangle. At each successive stage add 3*(n-1) new triangles around outside with edge-to-edge contacts. Sequence gives number of triangles (regardless of size) at n-th stage.at n=32A064412
- Structured triakis octahedral numbers (vertex structure 4).at n=16A100171
- Iccanobirt prime indices (5 of 15): Indices of prime numbers in A102115.at n=12A102135
- Expansion of 1/(1-x-x^5-x^6).at n=30A121832
- a(n) = 3*a(n-1) - 4*a(n-3), with a(0)=1, a(1)=2, a(2)=4, a(3)=9.at n=13A136298
- 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, -1, 0), (-1, 1, 0), (-1, 1, 1), (1, 0, 1), (1, 1, -1)}.at n=8A149418
- a(n) = 8*n^2 - 6*n - 1.at n=44A194431
- Number of (n+3) X 1 arrays of occupancy after each element moves up to +-3 places but not 0.at n=5A222550
- T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places but not 0.at n=33A222555
- a(0)=0, a(1)=1, a(n) = min{4 a(k) + (4^(n-k)-1)/3, k=0..(n-1)} for n>=2.at n=23A259665
- a(1) = 1, for n >= 2, a(n) = Sum_{i=1..floor(log_2(n))} a(n-i).at n=18A306622
- Numbers k such that k and k+2 are both A000120-perfect numbers (A175522).at n=21A360639
- Integers k for which A000594(k)^2 > 4 k^11, where A000594 is Ramanujan's tau function.at n=40A364087
- Numbers k for which A276085(k) is a multiple of 3125, where A276085 is fully additive with a(p) = p#/p.at n=6A377878
- Number of integer partitions of n with origin-to-boundary graph-distance equal to 4.at n=58A384562