10470
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25200
- Proper Divisor Sum (Aliquot Sum)
- 14730
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2784
- Möbius Function
- 1
- Radical
- 10470
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 86
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Pseudoprimes to base 31.at n=36A020159
- Number of chiral n-ominoes in (n-1)-space, one cell labeled.at n=14A045648
- Numbers k such that 10^k + 3 is prime.at n=17A049054
- a(n) = Sum_{k=1..floor((n+1)/2)} T(n,2k-1), array T as in A049777.at n=38A049778
- House numbers: a(n) = (n+1)^3 + Sum_{i=1..n} i^2.at n=19A051662
- T(n,n-4), where T is the array in A055830.at n=35A055831
- Boustrophedon transform of (-1)^n.at n=10A062162
- a(n) = ceiling(((1*n^0 + 1*n^1 + 2*n^2 + 4*n^3)/(1*n^0 + 2*n^1 + 1*n^2))^2).at n=26A085505
- Triangle read by rows: T(n,k) is the number of permutations of [n] with k runs of length 1. For example, 457/3/26/1 has two runs of length 1: 3 and 1.at n=37A097898
- Numbers j such that j divides the sum of the digits of j!.at n=19A108825
- n*(1+3*n+6*n^2)/2.at n=15A115519
- Even pseudoprimes to base 31.at n=6A130440
- a(n) = 361*n + 1.at n=28A158310
- Number of n X n arrays of squares of integers with every 2X2 subblock summing to 18.at n=8A159219
- Numbers n for which n' + n and n' - n are both prime, n' being the arithmetic derivative of n.at n=27A229272
- Maximum values occurring in each row of A233270: a(n) = A233270(A233268(n) - A234020(n)).at n=17A234019
- 26-gonal numbers: a(n) = n*(12*n-11).at n=30A255185
- G.f.: Sum_{n>=0} x^n * Product_{k=1..n} (1 - x^(n+k))/(1 - x^k).at n=36A260894
- Expansion of (1/(1 - x))*Product_{k>=1} (1 - x^(3*k))/(1 - x^k).at n=32A304630
- a(n) = 1*2 + 3 + 4*5 + 6 + 7*8 + 9 + 10*11 + 12 + ... + (up to n).at n=44A305189