15067
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17360
- Proper Divisor Sum (Aliquot Sum)
- 2293
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12960
- Möbius Function
- -1
- Radical
- 15067
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 115
- 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
- no
- Odd
- yes
Appears in sequences
- Pseudoprimes to base 14.at n=41A020142
- Strong pseudoprimes to base 74.at n=19A020300
- Strong pseudoprimes to base 75.at n=24A020301
- a(1) = 3; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=37A025004
- Numbers having four 3's in base 8.at n=28A043436
- Integers n > 10553 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10553.at n=7A063061
- Number of antisymmetric transitive binary relations on n unlabeled points.at n=6A079265
- Half-sum (or average) of cubes of two distinct odd primes.at n=36A138855
- Products of three distinct primes of the form 6*k + 1.at n=35A154729
- a(n) = (3^(6*n) - 2^(6*n))/35.at n=2A198412
- Number of nX3 arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nX3 array.at n=5A220199
- T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nXk array.at n=33A220204
- Number of 6Xn arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 6Xn array.at n=2A220209
- Fibonacci-like sequence of numbers with nondecreasing positive digits. Let a^+ denote the number that is obtained from a if its positive digits are written in nondecreasing order, while zeros remain in their places. Let a<+>b = (a + b)^+. a(0)=0, a(1)=1, for n>=2, a(n) = a(n-1) <+> a(n-2).at n=71A237568
- Number of maximal irredundant sets in the n-Andrásfai graph.at n=12A291053
- Numbers k such that (37*10^k + 341)/9 is prime.at n=16A295837
- Number of double palindrome structures of length n using exactly two different symbols.at n=19A328688
- Numbers k such that k - A067666(k) is a square.at n=35A386304