15165
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 26364
- Proper Divisor Sum (Aliquot Sum)
- 11199
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8064
- Möbius Function
- 0
- Radical
- 5055
- 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
- 177
- 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
- Positive numbers k such that k and 3*k are anagrams in base 7 (written in base 7).at n=22A023069
- Numbers which contain exactly the same digits (with the correct multiplicity) in 3 different smaller bases.at n=24A059828
- 2^n + 1 - 2*Fibonacci(n+1).at n=14A119587
- Triangular array read by rows: T(n,k) is the number of set partitions of {1,2,...,n} in which the shortest block has length k (1 <= k <= n).at n=46A178979
- Number of strings of numbers x(i=1..n) in 0..5 with sum i*x(i)^2 equal to n*25.at n=8A184437
- Smallest k such that the number k^n in its decimal representation has a prime number of copies of the digit d for each d from 0 through 9.at n=3A217051
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 590", based on the 5-celled von Neumann neighborhood.at n=36A273117
- Number of Carlitz compositions of n that either have length 1, or have length greater than or equal to 2 and are palindromic if we exclude the first part.at n=32A291941
- Number of integer partitions of n for which the parts have the same median as the multiplicities.at n=44A360456
- Main diagonal of A368179: the n-th term in the trajectory of n under the A006368 map.at n=50A368180
- Convolution of Leonardo numbers with Jacobsthal numbers.at n=13A377728