15959
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15960
- 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
- 15958
- Möbius Function
- -1
- Radical
- 15959
- 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
- 53
- 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
- 1859
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = T(2n+1,n+3), T given by A026758.at n=6A026878
- Primes with consecutive digits that differ exactly by 4.at n=9A048401
- Primes whose consecutive digits differ by 3 or 4.at n=35A048415
- Primes whose consecutive digits differ by 4 or 5.at n=22A048416
- Numbers k such that in the ring Z[sqrt(3)] the norm of (-1+sqrt(3))^k-1 is prime.at n=15A067834
- Primes with all odd digits such that the next three primes also contain all odd digits.at n=13A068831
- Primes in which the digit string can be partitioned into three parts such that third (least significant) part is the product of the first two.at n=10A088294
- Upper prime of a difference of 22 between consecutive primes.at n=29A098976
- Highly cototient numbers that are prime, or intersection of A000040 and A100827.at n=35A105440
- Primes with digit sum = 29.at n=39A106766
- Start with the binary representation of the Catalan constant (A104338, A006752) = 0.91596559... = sum_{i=1..infinity} b(i)/2^i, where b(i)=1,1,1,0,1,0,1,0,0,1,1,1,1.... Then a(n-1)=sum_{i=1..k: sum_{ j = 1..k} b(j)=n} b(i) * 2^(i-1). In words: scan the binary digits of the number, halt at each nonzero binary digit, add a power of 2 corresponding to the place of this digit after the comma, assign current partial sum to a(n), increment n.at n=9A113860
- Smallest prime p such that p == 1 (mod prime(n)) and not p == 1 (mod k) for 2 < k < prime(n).at n=21A116605
- Prime quartet leaders: largest number of a prime quartet.at n=39A119892
- Primes congruent to 6 mod 53.at n=32A142536
- Primes congruent to 29 mod 59.at n=35A142756
- Primes congruent to 38 mod 61.at n=32A142836
- 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, -1), (-1, -1, 1), (-1, 0, 1), (1, 1, -1), (1, 1, 0)}.at n=9A148762
- Largest primes of 'a' consecutive primes whose sum is a prime in A152471.at n=35A152472
- Lesser of two consecutive primes p,q such that q^2 - p^2 + 1 = the square of a prime.at n=46A157750
- Primes p such that 3*p+4, 5*p+6 and 7*p+8 are also prime.at n=20A173879