8730
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 22932
- Proper Divisor Sum (Aliquot Sum)
- 14202
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2304
- Möbius Function
- 0
- Radical
- 2910
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 47
- 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
- Expansion of 1/((1-5x)(1-7x)(1-8x)(1-10x)).at n=3A028181
- Numbers k such that k^2 is palindromic in base 8.at n=36A029805
- Base 8 digits are, in order, the first n terms of the periodic sequence with initial period 2,1,0,3.at n=4A037734
- 22-gonal numbers: a(n) = n*(10*n-9).at n=30A051874
- Number of 3 X 3 stochastic matrices under row and column permutations.at n=38A052282
- Numbers k that can be expressed as k = w + x = y*z with w*x = y^2 + z^2 where w, x, y, and z are all positive integers.at n=14A057373
- Number of 2 X 2 singular integer matrices with elements from {0,...,n}.at n=33A059306
- Least k such that k*11^n +/- 1 are twin primes.at n=32A064220
- Group successively larger composite numbers so that the sum of the n-th group is a multiple of n. Sequence gives the sum of the terms in the n-th group.at n=29A074120
- Pair the natural numbers such that the n-th pair is (k, k+p(n)) where k is the smallest number not occurring earlier and p(n) is the n-th prime. (1, 3), (2, 5), (4, 9), (6, 13), (7, 18), (8, 21), (10, 27), (11, 30), (12, 35), (14, 43), ... This is the sequence of the product of the members of every pair.at n=34A075316
- Number of ways of writing n as the sum of n+1 triangular numbers, divided by n+1.at n=12A106336
- Elements of A005282 that are also the sum of a pair of not necessarily distinct elements of A005282.at n=14A133604
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=6.at n=41A135191
- a(n) = 1458*n - 18.at n=5A157508
- Number of partitions of n having no parts with multiplicity 5.at n=33A184640
- Number of -n..n arrays x(0..5) of 6 elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=36A200184
- a(n) = Sum_{k=0..3} binomial(6,k)*binomial(n,k).at n=14A247608
- Triangle: Newton expansion of C(n,m)^4, read by rows.at n=18A262705
- Triangle T(n,t) by rows: The number of rooted forests with n 3-colored nodes and t rooted trees.at n=32A271879
- Smallest number k > 0 such that b - r is even or r = 0 for all b = 1..n, r == k mod b.at n=30A281072