15975
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 29016
- Proper Divisor Sum (Aliquot Sum)
- 13041
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8400
- Möbius Function
- 0
- Radical
- 1065
- Omega Function (Ω)
- 5
- 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
- 97
- 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
- no
- Odd
- yes
Appears in sequences
- Smallest number m such that m and the product of digits of m are both divisible by 5n, or 0 if no such number exists.at n=44A073911
- Integer part of the area of consecutive prime sided tetragons with one right angle.at n=30A105270
- a(n) = smallest exponent k such that the string "1 2 ... n" appears in the decimal expansion of 2^k.at n=7A171768
- a(1) = 1, and for each k >=2, a(k) is the smallest number n such that n/sin(n) > a(k)/sin(a(k)), so that a(1)/sin(a(1)) > a(2)/sin(a(2)) > ... > a(k)/sin(a(k)) > ...at n=36A172445
- Total area of the bounding boxes of all integer partitions of n.at n=18A182094
- Number of n X 5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 0 1 vertically.at n=7A207596
- Number of distinct connected unicyclic bipartite graphs with n vertices.at n=13A214650
- Smallest number m such that 2^m contains a string of n consecutive increasing digits in its decimal representation.at n=8A238448
- Least number k > 0 such that 2^k contains an n-digit long substring of the infinite string "0123456789012345678901234567890123456....".at n=8A243150
- Products of three distinct tribonacci numbers > 1.at n=32A274434
- Triangular array read by rows. T(n,k) is the number of inequivalent (as defined below) transitive binary relations R on [n] such that |domain(R intersect R^(-1))| = k, n>=0, 0<=k<=n.at n=25A369776