15732
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
- 36
- Divisor Sum
- 43680
- Proper Divisor Sum (Aliquot Sum)
- 27948
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4752
- Möbius Function
- 0
- Radical
- 2622
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 146
- 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
- Non-palindromic solutions to sigma(R(n)) = sigma(n), where R = A004086 is digit-reversal.at n=11A085329
- Triangle read by rows: numbers of isomers of unbranched a-4-catapolyoctagons.at n=38A120649
- Numbers of isomers of unbranched a-4-catapolyoctagons - see Brunvoll reference for precise definition.at n=6A121146
- A090801(2n-1)+A090801(2n).at n=35A140958
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (1, 0, 0), (1, 0, 1), (1, 1, 0)}.at n=7A151100
- Multiples of 19 whose digit reversal - 1 is also a multiple of 19.at n=38A166399
- Number of right triangles on a (n+1) X 4 grid.at n=32A189808
- Number of (n+1)X(4+1) 0..2 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=5A231392
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=41A231396
- Number of (6+1) X (n+1) 0..2 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=3A231402
- Averages q of twin prime pairs, such that q concatenated to q is also the average of a twin prime pair.at n=23A235109
- Sum of the two smallest parts from the partitions of 4n into 4 parts with smallest part = 1.at n=28A239059
- Numbers n such that n is the average of four consecutive primes n-5, n-1, n+1 and n+5.at n=28A258088
- Number of (n+1)X(3+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.at n=6A262467
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.at n=42A262472
- Number of (7+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.at n=2A262477
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 157", based on the 5-celled von Neumann neighborhood.at n=28A270331
- a(n) is the least number k for which A330437(k) = n.at n=23A330704
- Triangle read by rows: T(m,n) (m >= n >= 1) = number of regions formed by drawing the line segments connecting any two of the (m+1) X (n+1) lattice points in an m X n grid of squares and extending them to the boundary of the grid.at n=30A333282
- Expansion of 1/sqrt((1 - x^3)^2 - 4*x).at n=8A376791