10794
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 24768
- Proper Divisor Sum (Aliquot Sum)
- 13974
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3072
- Möbius Function
- 1
- Radical
- 10794
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 117
- 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
- Smallest k such that the smallest palindrome > k in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=38A015994
- a(0) = 0. For n > 0, smallest non-palindromic number k such that the smallest palindrome in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=39A023109
- Least number of Reverse-then-add persistence n.at n=39A033866
- Decimal part of cube root of a(n) starts with 1: first term of runs.at n=20A034127
- Numbers whose base-2 representation has exactly 12 runs.at n=33A043579
- Numbers which are the sum of their proper divisors containing the digit 9.at n=31A059468
- Numbers k such that k*prime(k) -+ 1 are twin primes.at n=37A085637
- Self-convolution of A086582; the first 2^n terms of this sequence gives the 2^n terms that follow the 2^n-th term of A086582.at n=41A086583
- The rightmost column of triangle A094280.at n=11A094282
- Numbers k such that k and 8*k, taken together, are pandigital.at n=8A114126
- Minimum number of terms required in the Gregory-Leibniz series, i.e., 4(1 - 1/3 + 1/5 - 1/7 + 1/9 - ...), to obtain a value of Pi correct to n decimal digits.at n=4A126809
- Indices n such that A134204(n) < n.at n=15A133242
- Numbers that are the sum of two reversed consecutive primes in more than one way.at n=35A162705
- Number of generalized mountain numbers (see A134853) with n digits.at n=5A178912
- Second 14-gonal numbers: n*(6*n+5).at n=42A211014
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and 2w+x+y>0.at n=14A211617
- Numbers n such that n+(n+1), n^2+(n+1)^2, n+(n+1)^2, n^2+(n+1) are all prime.at n=19A216270
- Triangular array read by rows: T(n,k) is the number of partial permutations of {1,2,...,n} that have exactly k cycles, 0<=k<=n.at n=51A216294
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..6 array extended with zeros and convolved with -1,2,-1.at n=16A222041
- Palindromic numbers in bases 4 and 8 written in base 10.at n=29A259382