11461
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11692
- Proper Divisor Sum (Aliquot Sum)
- 231
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11232
- Möbius Function
- 1
- Radical
- 11461
- 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
- 29
- 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
- a(n) = 10000*log_10(n) rounded down.at n=13A004228
- a(n) = 10000*log_10(n) rounded to the nearest integer.at n=13A004229
- Cubes written in base 8.at n=16A004638
- Numbers k such that the continued fraction for sqrt(k) has period 83.at n=6A020422
- Positive numbers having the same set of digits in base 9 and base 10.at n=38A037443
- Number of connected graphs with <= n edges.at n=10A046745
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=31A050031
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.at n=37A064909
- a(n) = 6*binomial(n,4) + 5*binomial(n,2) - 4*n + 5.at n=15A066455
- Upper bound on number of regular triangulations of cyclic polytope C(n, n-4).at n=30A066456
- Number of distinct lines through the origin in 3-dimensional cube of side length n.at n=23A090025
- Number of one-element transitions from the partitions of n to the partitions of n+1 for labeled parts.at n=23A093694
- a(n) = a(n-1)+a(n-2)-a(n-3)+a(n-5), n>7.at n=28A107287
- Odd winning positions in Fibonacci nim.at n=20A120904
- 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, -1, 1), (-1, 0, 1), (1, 1, 0)}.at n=10A148523
- Triangle read by rows: T(n,m) (n >= 1, 1 <= m <= n) = number of set partitions of [n], avoiding 123454, with m blocks.at n=50A250119
- Number of length n+7 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=28A255998
- Number of equivalence classes of ballot paths of length n for the string uu.at n=17A274110
- a(n) = A277713(n)/3.at n=48A277714
- a(1) = 1; a(n) = a(n-1) + 2 * a(floor(n/2)).at n=34A347027