9083
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9408
- Proper Divisor Sum (Aliquot Sum)
- 325
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8760
- Möbius Function
- 1
- Radical
- 9083
- 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
- 91
- 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(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=29A034076
- a(1)=a(2)=1; a(n)=reverse(reverse(a(n-1))+reverse(a(n-2))) for n > 2.at n=20A072210
- Numbers which are the sum of three positive cubes and divisible by 31.at n=40A104054
- Numbers which are the sum of 3 cubes of distinct odd primes.at n=26A138853
- 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, 0, 0), (0, -1, 1), (1, 0, -1), (1, 1, 0)}.at n=9A148777
- Number of binary strings of length n with equal numbers of 00110 and 01010 substrings.at n=14A164252
- Row sums of triangle A179901.at n=19A179902
- Number of nonempty subsets of {1, 2, ..., n} with <=6 pairwise coprime elements.at n=25A187267
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2<=x^2+y^2.at n=23A211634
- Number of n X 3 integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.at n=5A266126
- T(n,k) = Number of n X k integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.at n=33A266131
- Number of 6Xn integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.at n=2A266136
- Number of nX4 0..1 arrays with every element unequal to 0, 1, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=12A318078
- Prime generating polynomial: a(n) = (4*n - 29)^2 + 58.at n=30A320772
- Where the zeros in A123066 occur.at n=34A321962
- Sum of end-to-end Manhattan distances over all self-avoiding n-step walks on 4-d cubic lattice.at n=4A323857
- a(n) = sum for all integer partitions of n of the number of distinct multiplicities in each partition.at n=27A373271
- a(n) is the smallest possible side x in a family of triangles with integer sides x, y < x, x-y < z < x+y, such that exactly n pairs of triangles with equal area exist in this family.at n=36A375748
- Numbers k such that the concatenations of k and 123456789 in both orders are prime.at n=46A384218