10851
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
- 4
- Divisor Sum
- 14472
- Proper Divisor Sum (Aliquot Sum)
- 3621
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7232
- Möbius Function
- 1
- Radical
- 10851
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 161
- 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
- Numerator in Feinler's formula for unsigned Bernoulli number |B_{2n}|.at n=8A002443
- Crystal ball sequence for diamond.at n=23A007904
- Hybrid binary rooted trees with n nodes whose root is labeled by "a".at n=7A011272
- a(n) = Sum_{k=1..n} k*phi(k).at n=36A011755
- Numbers k such that 161*2^k+1 is prime.at n=18A032457
- Number of 5-ary rooted trees with n nodes and height exactly 5.at n=15A036636
- Polynomial extrapolation of 2, 3, 5, 7, 11.at n=19A061165
- Triangle of numerators of coefficients of Faulhaber polynomials in Knuth's version.at n=42A093556
- Numbers k such that 2^(2*k - 1) - 1 is prime.at n=23A138576
- 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, 1), (-1, 0, 1), (1, -1, 0), (1, 0, -1), (1, 1, 0)}.at n=8A149284
- Number of binary strings of length n with equal numbers of 000 and 011 substrings.at n=16A164139
- Partial sums of round(5^n/9).at n=7A178577
- Numbers k such that k^2+1 = 2p,(k+1)^2+1 = 5q, (k+2)^2+1 = 10r where p, q, and r are primes.at n=17A181619
- Number of (n+2) X 4 binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=7A202455
- T(n,k)=Number of (n+2)X(k+2) binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=37A202461
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w+2x+3y>0.at n=14A211621
- Number of partitions p of n that are separable by the 2*min(p); see Comments.at n=51A239516
- Record values in A246272.at n=24A246350
- Number of (n+1) X (3+1) 0..1 arrays with every 2 X 2 subblock antidiagonal maximum minus diagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal minimum nondecreasing vertically.at n=37A253392
- Numbers n for which the numbers 6n+1, 3n+2, 6n+7 are all odd composite squarefree numbers, but none are semiprimes.at n=10A263510