15361
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15362
- 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
- 15360
- Möbius Function
- -1
- Radical
- 15361
- 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
- 177
- 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
- 1795
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Least inverse of A001390, or 0 if no inverse exists.at n=28A020638
- Primes that remain prime through 3 iterations of function f(x) = 9x + 2.at n=32A023296
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 84 ones.at n=7A031852
- Trajectory of 1 under map n->9n+1 if n odd, n->n/2 if n even.at n=28A033962
- Trajectory of 3 under map n->9n+1 if n odd, n->n/2 if n even.at n=38A037102
- Number of partitions satisfying cn(1,5) <= cn(2,5) + cn(3,5) and cn(4,5) <= cn(2,5) + cn(3,5).at n=38A039890
- a(n) = 3*n*2^(n-1) + 1.at n=10A048474
- Smallest factor of (2n)^(2n) + 1.at n=39A055386
- Primes p such that the greatest prime divisor of p-1 is 5.at n=36A061599
- Smallest prime p such that (p-1) has n divisors, or 0 if no such prime exists.at n=43A066814
- Primes p such that the period of the decimal expansion of 1/p is a square.at n=23A072858
- Primes p for which the period of 1/p is a power of 2.at n=12A072982
- Smallest prime p with bigomega(p-1)=n, where bigomega(m)=A001222(m) is the number of prime divisors of m (counted with multiplicity).at n=12A073919
- Numbers n such that sum of squares of even digits of n equals sum of squares of odd digits of n.at n=20A076164
- a(n) = 512*n + 1.at n=30A076338
- Primes of the form 512*k+1.at n=5A076339
- Prime mean of 8 horizontal, vertical and main diagonal sums associated with primes in A094454.at n=16A094455
- Elite primes: a prime number p is called elite if only a finite number of Fermat numbers 2^(2^n)+1 are quadratic residues mod p.at n=4A102742
- Primes of the form 2^a * 3^b * 5^c + 1 for positive a, b, c.at n=28A114991
- Primes p for which the period length of 1/p is a perfect power, A001597.at n=30A128948