10727
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11376
- Proper Divisor Sum (Aliquot Sum)
- 649
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10080
- Möbius Function
- 1
- Radical
- 10727
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 99
- 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
- Global ranks of terms of A057122: tells which terms of A014486 form rooted plane binary trees also when interpreted as codes for ordinary rooted planar trees.at n=32A057123
- Let f(x) = phi(x) + sigma(x); a(n) = least k such that at k begins a maximal run of length n of consecutive strict local extrema of f, or 0 if no such k exists.at n=26A066923
- a(n) = n^3 + prime(n).at n=21A089620
- Number of partitions of the n-th decimal palindrome into distinct decimal palindromes.at n=39A091585
- The 2k-th moments of the random graph G(n, 1/n) (odd moments are zero). The number of walks of length 2k on _all_ bushes (rooted plane trees) that start and end at the root and visit new vertices from left-to-right (but may return).at n=6A094149
- Number of partitions of an n-set with an even number of blocks of size 1.at n=8A111724
- Numbers k such that sigma(k) - phi(k) is a 4th power.at n=18A115918
- Number of strings over a 5 symbol alphabet with adjacent symbols differing by three or less.at n=6A126473
- a(n) = 49*n^2 - 20*n + 2.at n=14A157373
- First differences of the dying rabbits sequence A000044.at n=22A191869
- T(n,k)=Number of 0..k arrays of length n+1 with 0 never adjacent to k.at n=32A212835
- Number of 0..n arrays of length 6 with 0 never adjacent to n.at n=3A212839
- a(n) = n*(19*n-15)/2.at n=34A226490
- Number of partitions p of n such that (maximal multiplicity of the parts of p) >= (maximal part of p).at n=42A240313
- Integers of the form 8k+7 that can be written as a sum of four distinct squares of the form m, m+2, m+4, m+5, where m == 1 (mod 4).at n=12A243579
- Indices of record values in A246785.at n=16A246790
- Indices of record values in A246793.at n=15A252475
- 24-hedral numbers: a(n) = (2*n + 1)*(8*n^2 + 14*n + 7).at n=8A254473
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 790", based on the 5-celled von Neumann neighborhood.at n=26A273562
- Array read by antidiagonals: T(m,n) = number of m-ary words of length n with adjacent elements differing by 3 or less.at n=29A285267