10912
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
- 24
- Divisor Sum
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 13280
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 0
- Radical
- 682
- Omega Function (Ω)
- 7
- 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
- 16
- 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(n) = floor(n*phi^15), where phi is the golden ratio, A001622.at n=8A004930
- a(n) = round(n*phi^15), where phi is the golden ratio, A001622.at n=8A004950
- a(n) = 2*binomial(n,3).at n=33A007290
- a(1) = 7; a(n+1) = a(n)-th composite.at n=32A025011
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 3 (most significant digit on left).at n=6A029472
- Theta series of 8-dimensional strongly 6-modular lattice O(6) with minimal norm 3.at n=27A029720
- Coefficients of the '6th-order' mock theta function rho(q).at n=47A053270
- Numbers k such that k | sigma_3(k) - phi(k)^3.at n=15A055697
- Third column sequence of unsigned triangle A056588.at n=8A056589
- a(n) = (a(n-1)a(n-5) + a(n-2)a(n-4) + a(n-3)^2)/a(n-6).at n=58A058232
- Numbers with exactly 2 odd integers in their Collatz (or 3x+1) trajectory.at n=39A062052
- Convolution of sigma(n) with phi(n).at n=40A086733
- Triangle, read by rows, such that row n equals the inverse binomial transform of column n of the triangle A034870 of coefficients in successive powers of the trinomial (1+2*x+x^2), omitting leading zeros.at n=52A099605
- Triangle read by rows: number of atomic set compositions of size n and length k (see description in A095989) 1 <= k <= n.at n=26A109062
- Difference between the product of two consecutive primes and the next prime.at n=26A111071
- a(n) = C(n,a)+C(n,b)+C(n,c)... where n = abc... are the decimal digits of n.at n=33A111696
- Number of monic irreducible polynomials of degree 3 in GF(2^n)[x].at n=4A115489
- Rectangular table, read by antidiagonals, such that the g.f. of row n, R_n(y), satisfies: R_n(y) = [ Sum_{k>=0} y^k * R_k(y)^n ]^n for n>=0, with R_0(y) = 1.at n=51A124540
- Row 3 of rectangular table A124540; equals the self-convolution cube of A124533 (row 3 of table A124530).at n=6A124543
- Unsigned version of A056588.at n=57A126770