15733
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15734
- 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
- 15732
- Möbius Function
- -1
- Radical
- 15733
- 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
- 146
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1834
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 65.at n=16A020404
- Numbers whose base-4 representation contains exactly four 1's and three 3's.at n=32A045132
- Numbers n such that n and n+4^k are all primes for k=1,2,3.at n=34A049493
- Number of partitions of n into at most 1 copy of 1, 2 copies of 2, 3 copies of 3, ... .at n=46A052335
- a(1)=2; for n>1 a(n) is the largest prime number m such that a(n-1)^(1/(n-1))>m^(1/n).at n=22A086566
- Sequence of primes p(n) such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.at n=3A088119
- Add/multiply sequence, see example.at n=45A093361
- Primes occurring in exactly three prime triples (p,q,r) with p<q<r=p+6.at n=9A098423
- Numbers n such that the numbers of divisors of n,n+1,n+2 and n+3 are k,2k,4k,8k respectively for some k.at n=7A100364
- Smallest prime of just n consecutive primes all of which are irregular.at n=7A105019
- a(n) = (n^6 - 126*n^5 + 6217*n^4 - 153066*n^3 + 1987786*n^2 - 13055316*n + 34747236)/36.at n=38A121888
- Prime quadruples: 2nd term.at n=14A136720
- Prime numbers p such that p +- ((p-1)/2) are primes.at n=36A137702
- Primes congruent to 35 mod 47.at n=38A142386
- Primes congruent to 4 mod 49.at n=41A142417
- Primes congruent to 45 mod 53.at n=35A142575
- Primes congruent to 39 mod 59.at n=31A142766
- Primes congruent to 56 mod 61.at n=32A142854
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1100-0111-1100 pattern in any orientation.at n=15A146680
- 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), (0, 0, -1), (0, 1, -1), (0, 1, 1), (1, 0, -1)}.at n=9A149104