10356
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 13836
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3448
- Möbius Function
- 0
- Radical
- 5178
- 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
- 42
- 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
- Number of multigraphs with 4 nodes and n edges.at n=28A003082
- Number of 4-ary rooted trees with n nodes and height at most 9.at n=13A036614
- Triangle T(n,k) = number of minimal covers of an unlabeled n-set that cover k points of that set uniquely, k=0..n.at n=71A056885
- a(n) = floor( n^e ), e = 2.718281828...at n=29A061293
- Let n = Sum_i d_i*10^i (0 <= d_i <= 9) be the decimal expansion of n. Then n is in the sequence if Sum_i d_i*b^i divides n for some base b >= 2 in the range max d_i < b < 10.at n=50A062010
- Numbers n which are a proper multiple (>1) of A068505(n) (= n read in base m+1 where m = largest digit of n).at n=26A089584
- k's first occurrence in A102932.at n=38A101255
- Numbers k such that there are 9 digits in k^2 and for each factor f of 9 (1,3) the sum of digit groupings of size f is a square.at n=20A153747
- Number of n-digit primes in carryless arithmetic mod 10.at n=7A169962
- Number of 2 X 2 matrices having all elements in {-n,...,n} and determinant 1.at n=32A209982
- Number of (n+3)X(3+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.at n=2A263121
- T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.at n=12A263124
- Number of (3+3)X(n+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.at n=2A263127
- a(n) = 10^(prime(n)-1) mod prime(n)^2.at n=28A265012
- Number of 2 X 2 X 2 triangular 0..n arrays with some element plus some adjacent element totaling n+1 or n-1 exactly once.at n=42A270607
- Numbers k such that (17*10^k + 13)/3 is prime.at n=23A272059
- Positive numbers k such that k^2 - 1 divides 8^k - 1.at n=40A272062
- a(n) = 164*2^n - 140.at n=6A305166
- Numbers k such that k divides sum of k-th twin prime pair.at n=29A335303
- Coordination sequence for the hypertriangular lattice.at n=44A344126