15602
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24300
- Proper Divisor Sum (Aliquot Sum)
- 8698
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7504
- Möbius Function
- -1
- Radical
- 15602
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Positive numbers k such that k and 3*k are anagrams in base 8 (written in base 8).at n=6A023074
- Non-palindromic n and its digit reversal have the same sum of prime factors (with repetition).at n=37A085607
- Number of compositions (ordered partitions) of n into at least 2 distinct positive parts.at n=27A216695
- Triangle read by rows, arising in enumeration of permutations by cyclic peaks.at n=18A216962
- Triangle read by rows, related to Bell numbers A000110: A216962 interlaced with A216964.at n=32A217204
- Number of nondecreasing -n..n vectors of length 3 whose dot product with some nondecreasing -n..n vector equals 3.at n=22A226411
- Number of length 3 arrays x(i), i=1..3 with x(i) in i..i+n and no value appearing more than 2 times.at n=23A250352
- Bernoulli number B_{n} has denominator 354.at n=37A255684
- a(n) = 10*n^2 + 10*n + 2.at n=39A273366
- Number of self-intersecting walks of length n on a square lattice such that at each point the angle turns 90 degrees.at n=24A293865
- Numbers m such that A338038(m) = A338038(A004086(m)) where A004086(i) is i read backwards and A338038(i) is the sum of the primes and exponents in the prime factorization of i ignoring 1-exponents; palindromes and multiples of 10 are excluded.at n=31A338039