15052
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 27216
- Proper Divisor Sum (Aliquot Sum)
- 12164
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7280
- Möbius Function
- 0
- Radical
- 7526
- Omega Function (Ω)
- 4
- 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
- 40
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(1)=1, a(n) = 24*a(n-1) + n.at n=3A014913
- Decimal part of n^(1/11) starts with a 'nine digits' anagram.at n=4A034286
- a(n) = n plus sum of previous three terms.at n=15A062544
- Integers that are Rhonda numbers to base 12.at n=13A100971
- Number of permutations of length n which avoid the patterns 123, 3142, 4312; or avoid the patterns 123, 3421, 4231.at n=43A116721
- a(n) is the smallest number k larger than a(n-1) such that n*d(k)*sopf(k)=sigma(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472).at n=17A134382
- Numbers k such that the string k modulo 1000 is found at position k in the decimal digits of Pi.at n=40A153226
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and no two neighbors equal.at n=13A199706
- Number of n X 2 0..2 arrays with no element equal the average of immediate neighbors vertically above and horizontally left of it.at n=5A208439
- Number of nX6 0..2 arrays with no element equal the average of immediate neighbors vertically above and horizontally left of it.at n=1A208443
- T(n,k)=Number of nXk 0..2 arrays with no element equal the average of immediate neighbors vertically above and horizontally left of it.at n=22A208445
- T(n,k)=Number of nXk 0..2 arrays with no element equal the average of immediate neighbors vertically above and horizontally left of it.at n=26A208445
- Number of partitions p of n such that 2*(number of even numbers in p) > (number of odd numbers in p).at n=37A241655
- Number of (n+2) X (7+2) 0..3 arrays with every consecutive three elements in every row and column having exactly two distinct values, and in every diagonal and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=10A252694
- Positive integers m such that none of the four consecutive numbers m, m+1, m+2, m+3 can be written as p^2 + q with p and q both prime.at n=8A258661
- Number of multisets of exactly seven partitions of positive integers into distinct parts with total sum of parts equal to n.at n=18A320792
- First position index for A197123(n) in the decimal expansion of Pi.at n=7A375789