10911
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14552
- Proper Divisor Sum (Aliquot Sum)
- 3641
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7272
- Möbius Function
- 1
- Radical
- 10911
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 192
- 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
- Number of ordered quadruples of integers from [ 1,n ] with no common factors between pairs.at n=38A015636
- 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=55A023109
- Indices of record high values in A033665, ignoring those numbers that are believed never to reach a palindrome.at n=10A065198
- 55 'Reverse and Add' steps are needed to reach a palindrome.at n=0A065322
- Consider the Reverse and Add! problem (cf. A001127); of all the n-digit numbers N which eventually reach a palindrome, pick that number N which takes the greatest number of steps to converge (in case of a tie, pick the smallest N); sequence gives values of N.at n=4A072216
- Greedy frac multiples of gamma: a(1)=1, Sum_{n>0} frac(a(n)*x) = 1 at x=gamma, where "frac(y)" denotes the fractional part of y.at n=13A080157
- a(n) = T(n) concatenated with reverse(T(n)) divided by 11, where T(n) is the n-th triangular number.at n=15A084008
- a(n) = A007290(n+2) - 1 = 2*C(n+2,3) - 1.at n=31A108766
- Semiprimes that are not the sum of 3 pentagonal numbers.at n=47A120535
- Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=1, k=-1 and l=-1.at n=11A176953
- Number of (6+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 7.at n=10A252390
- Number of integers in n-th generation of tree T(-2/3) defined in Comments.at n=33A274150
- Numbers k such that 6*10^k + 37 is prime.at n=23A281903
- a(n) = 1 - n + (2^(n+2) - (-1)^n)/3.at n=13A322783
- Numbers k such that k![4] - 16 is prime, where k![4] = A007662(k) = quadruple factorial.at n=28A329166
- Numbers with easy multiplication table - the first 9 multiples of these numbers can be derived by either incrementing or decrementing the corresponding digits from the previous multiple.at n=26A359925
- Non-palindromic numbers m such that m * repunit of length k is palindromic for all large enough k.at n=46A370053
- Number of partitions of 4n whose xor-sum is 2n.at n=17A370874