10213
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11680
- Proper Divisor Sum (Aliquot Sum)
- 1467
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8748
- Möbius Function
- 1
- Radical
- 10213
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 179
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Multiples of 7 whose sum of digits is equal to 7.at n=20A063416
- Row sums of triangle A084408.at n=27A084411
- For p = prime(n), a(n) is the smallest N such that pN is a base-2 pseudoprime (that is, 2^(pN-1) = 1 mod pN).at n=32A086000
- Each digit of a(n) appears in a(n+1) and a(n+1) > a(n) is minimal.at n=36A107411
- Number of partitions that are "3-close" to being self-conjugate.at n=41A108962
- Quaternary emirpimes.at n=23A114015
- A123896 sorted and duplicates removed.at n=31A123902
- Smallest number m such that exactly n odd numbers can be seen as proper subsequences of m in decimal representation.at n=16A164766
- The initial decimal digits of 2^a(n) are the decimal digits of n followed by n.at n=25A171652
- Number of (n+1)X(n+1) 0..4 arrays with every 2X2 subblock summing to 8.at n=2A183643
- Number of (n+1) X 4 0..4 arrays with every 2 X 2 subblock summing to 8.at n=2A183646
- T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock summing to 8.at n=12A183652
- Number of 0..5 arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors.at n=3A200883
- T(n,k) is the number of 0..k arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors.at n=31A200886
- Number of 0..n arrays x(0..5) of 6 elements without any interior element greater than both neighbors.at n=4A200889
- Triangle version of the array w(N,L) of the total number of round trips of length L on closed Laguerre graphs Lc_N.at n=51A201199
- Number of nX1 0..5 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.at n=6A203050
- Number of nX7 0..5 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.at n=0A203056
- T(n,k)=Number of nXk 0..5 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.at n=21A203057
- T(n,k)=Number of nXk 0..5 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.at n=27A203057