11073
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
- 14768
- Proper Divisor Sum (Aliquot Sum)
- 3695
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7380
- Möbius Function
- 1
- Radical
- 11073
- 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
- 130
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 70.at n=24A031568
- Numbers whose set of base-15 digits is {3,4}.at n=18A032839
- Triangle T(n,k) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using steps R=(1,0), V=(0,1) and D=(2,1).at n=51A071945
- a(n) = 9^n - 8^n - 7^n - 6^n + 3*5^n.at n=5A081890
- Partial sums of the central Delannoy numbers (A001850).at n=6A089165
- Triangle in A071945 with rows reversed.at n=48A108075
- Numbers m such that the permutation of the first m natural numbers R_m(n)=if(1<=n<m-pi(m), c(n), if(n=m, 1, prime(n-m-pi(m)+1))) is a cyclic permutation where c(k) is the k-th composite number(for each natural number k, c(k)=A002808(k)).at n=24A108517
- Smallest number m such that A114228(m) = n.at n=36A114229
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 41", based on the 5-celled von Neumann neighborhood.at n=25A269874
- Exponents of x in the numerator of cluster variables of a rank 2 cluster algebra.at n=13A272073
- Irregular triangle read by rows: rows are partial alternating sums of rows of A297191.at n=42A297193
- Left-hand half of triangle A297193.at n=27A297194
- Partial sums of A299266.at n=24A299267
- Numbers missing from A317416.at n=5A317418
- Numbers k such that usigma(uphi(k)) = uphi(usigma(k)), where usigma is the sum of unitary divisors function (A034448) and uphi is the unitary totient function (A047994).at n=33A329730
- T(j,k) are the numerators s in the representation R = s/t + (2/Pi)*u/v of the resistance between two nodes separated by the distance vector (j,k) in an infinite square lattice of one-ohm resistors, where T(j,k), j >= 0, 0 <= k <= j, is a triangle read by rows.at n=28A355565
- Number of integer partitions of n whose distinct parts are the binary indices of some prime number.at n=41A372887