9474
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18960
- Proper Divisor Sum (Aliquot Sum)
- 9486
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3156
- Möbius Function
- -1
- Radical
- 9474
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- yes
- Collatz Steps
- 60
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Armstrong (or pluperfect, or Plus Perfect, or narcissistic) numbers: m-digit nonnegative numbers equal to sum of the m-th powers of their digits.at n=16A005188
- Coordination sequence for MgNi2, Position Ni2.at n=24A009932
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MTT = ZSM-23 Nan[AlnSi24-nO48] starting with a T7 atom.at n=12A019192
- Perfect Digital Invariants: numbers that are the sum of some fixed power of their digits.at n=18A023052
- a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), m=[ (n+1)/2 ], T given by A026780.at n=12A026902
- 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 96.at n=15A031594
- First differences give (essentially) A028242.at n=44A035107
- Largest number that is equal to sum of n-th powers of its digits.at n=4A046761
- Fixed points for operation of repeatedly replacing a number with the sum of the fourth power of its digits.at n=4A052455
- Number of polyominoes with n cells without holes that do not tile the plane.at n=10A054361
- Global ranks of terms of A057122: tells which terms of A014486 form rooted plane binary trees also when interpreted as codes for ordinary rooted planar trees.at n=23A057123
- 4th-order digital invariants: the sum of the 4th power of the digits of n equals some number k and the sum of the 4th power of the digits of k equals n.at n=5A072409
- Limit set for operation of repeatedly replacing a number with the sum of the 4th power of its digits.at n=12A113708
- sigma(n) plus the n-th prime gives a cube.at n=6A114081
- sigma(n) plus the n-th prime gives a square.at n=38A114082
- Numbers appearing in the cycles of the "Recurring Digital Invariant Variant" problem described in A151543.at n=37A151544
- Nonzero coefficients of the g.f. that satisfies: A(x) = x + A(A(x))^3.at n=5A153851
- a(n) = 9*n^2 - 10*n + 3.at n=33A154262
- Numbers divisible by the sum of 4th powers of their digits.at n=21A169665
- Numbers n such that n^2 contains no digit less than 5.at n=44A175471