15259
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15260
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15258
- Möbius Function
- -1
- Radical
- 15259
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 84
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1780
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes of the form m^2 + 3m + 9, where m can be positive or negative.at n=36A005471
- Powers of fifth root of 17 rounded down.at n=17A018162
- Powers of fifth root of 17 rounded to nearest integer.at n=17A018163
- Primes that remain prime through 3 iterations of function f(x) = 3x + 2.at n=14A023277
- Primes that remain prime through 3 iterations of function f(x) = 5x + 8.at n=24A023286
- Base-7 palindromes that start with 6.at n=33A043020
- Primes whose consecutive digits differ by 3 or 4.at n=31A048415
- a(n) = a(n-1)+ceiling(a(n-2)/2) with a(0)=0, a(1)=1.at n=31A064323
- Numerator of Sum_{k=1..n} phi(k)/k^3.at n=5A072158
- Numbers n such that the k-th binary digit of n equals mu(k)^2 for k=1 up to A029837(n+1).at n=13A074988
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6, 2]; short d-string notation of pattern = [462].at n=24A078851
- Primes p such that the differences between the 5 consecutive primes starting with p are (4,6,2,6).at n=7A078955
- a(1) = 1; then primes associated with A091850.at n=33A091851
- Number of cells in column 2 of all deco polyominoes of height n. A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=6A121582
- Primes congruent to 31 mod 47.at n=37A142382
- Primes congruent to 20 mod 49.at n=40A142431
- Primes congruent to 48 mod 53.at n=34A142578
- Primes congruent to 37 mod 59.at n=33A142764
- Primes congruent to 9 mod 61.at n=31A142807
- a(n) = a(n-1) + a(n-2) - floor(a(n-2)/2), starting 2,1.at n=30A173497