10094
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17784
- Proper Divisor Sum (Aliquot Sum)
- 7690
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4284
- Möbius Function
- 0
- Radical
- 1442
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 135
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Number of points on surface of hexagonal prism: 12*n^2 + 2 for n > 0 (coordination sequence for W(2)).at n=29A005914
- Expansion of 1/((1-3x)(1-8x)(1-9x)(1-11x)).at n=3A028100
- Starting from generation 6 add previous and next term yielding generation 7.at n=36A048453
- Numbers n such that n | 7^n + 5^n + 3^n +1.at n=22A057830
- If D[n] is divisor-set of n, then in set of 1+D only 2 primes occur:{2,3}; also n is not squarefree.at n=32A072607
- 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), (-1, 1, 1), (0, -1, 0), (1, 1, -1), (1, 1, 0)}.at n=8A149354
- Numbers k such that k, k + 1 and k + 2 are 3 consecutive Harshad numbers.at n=26A154701
- Triangle read by rows: n-th row is the expansion of the polynomial (x-F1)*(x-F2)*(x-F3)*...*(x-Fn).at n=34A158472
- (n-1)-st elementary symmetric function of the first n Fibonacci numbers.at n=6A203006
- Remainder when sum of squares of the first n primes is divided by n-th square pyramidal number.at n=38A282282
- Numbers n with the property that n^2 contains a sequence of four or more consecutive 8's.at n=3A301938
- Number of primitive (period n) n-bead bracelet structures which are not periodic palindromes using exactly three different colored beads.at n=12A328038
- Regular triangle where T(n,k) is the number of non-isomorphic multiset partitions of k-element multiset partitions of multisets of size n.at n=48A330473
- Number of regions formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).at n=12A331766
- Number of permutations of {1, 2, 3, ..., n} that result in a final value of 0 by repeatedly iterating the process of "subtracting if the next item is greater or equal, otherwise adding" until there's only one number left.at n=9A373284