10998
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 26208
- Proper Divisor Sum (Aliquot Sum)
- 15210
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3312
- Möbius Function
- 0
- Radical
- 3666
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 68
- 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
- a(n) = n*(17*n - 1)/2.at n=36A022274
- Smallest number that can be made to take n steps to reach 0 under "k -> any product of 2 numbers whose concatenation is k".at n=19A035934
- Number of nonzero palindromes less than 10^n.at n=6A050250
- a(0) = 0; a(n) is obtained by incrementing each digit of a(n-1) by 1.at n=28A061511
- Number of partitions of n into nonsquares.at n=51A087153
- a(n) = floor((a(n-2)*a(n-1))/(a(n-1)+a(n-2))) + a(n-1) + a(n-2), a(0) = 0, a(1) = 1, a(2) = 1, ...at n=17A096080
- Integer part of the area of consecutive prime sided tetragons with one right angle.at n=26A105270
- Alexandrian integers: numbers of the form n = p*q*r such that 1/n = 1/p - 1/q - 1/r for some integers p,q,r.at n=18A147811
- Number of permutations of floor(i*8/5), i=0..n-1, with all sums of two and three adjacent terms respectively unique.at n=7A147897
- Numbers that are the sum of two reversed consecutive primes in more than one way.at n=40A162705
- Partial sums of A174928.at n=25A174929
- Number of 0..n arrays x(0..8) of 9 elements with zero 5th differences.at n=26A200332
- Number of partitions of n such that the number of parts and the greatest part are coprime.at n=35A200750
- Number of (n+1)X(n+1) 0..3 arrays with every 2X3 or 3X2 subblock having no more than four equal edges, and new values 0..3 introduced in row major order.at n=1A206513
- Number of (n+1)X3 0..3 arrays with every 2X3 or 3X2 subblock having no more than four equal edges, and new values 0..3 introduced in row major order.at n=1A206515
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having no more than four equal edges, and new values 0..3 introduced in row major order.at n=4A206521
- Number of n-bit numbers in A077436.at n=22A211676
- Triangle read by rows: T(n,k) is the number of n-tuples with sum k + n whose i-th element is a positive integer <= prime(i), 0 <= k < A070826(n).at n=59A239738
- Number of nX4 0..3 arrays with no element equal to the same number of vertical neighbors as horizontal neighbors, with new values 0..3 introduced in row major order.at n=3A241347
- T(n,k)=Number of nXk 0..3 arrays with no element equal to the same number of vertical neighbors as horizontal neighbors, with new values 0..3 introduced in row major order.at n=24A241349