4499
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4920
- Proper Divisor Sum (Aliquot Sum)
- 421
- 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
- 4080
- Möbius Function
- 1
- Radical
- 4499
- 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
- 46
- 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
- Numbers k such that Fibonacci(k) == 89 (mod k).at n=47A023182
- In base 11, a(n) = sum of digits of Lucas(a(n)).at n=37A025491
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 17 (most significant digit on left).at n=5A029486
- 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 67.at n=1A031565
- Exactly 5 digits from {1,2,3,4,5,6,7,8,9} can precede a(n) to form a prime.at n=39A032695
- Coordination sequence T2 for Zeolite Code CFI.at n=44A033600
- Coordination sequence T3 for Zeolite Code AWO.at n=46A038405
- Geometric mean of the digits = 6. In other words, the product of the digits is = 6^k where k is the number of digits.at n=26A061429
- a(n) = smallest k such that 2k has digit sum = n.at n=33A077491
- a(n) = floor(7^n/5^n).at n=25A094984
- Semiprimes with semiprime digits (digits 4, 6, 9 only).at n=17A107342
- Numbers with semiprime digits (digits 4, 6, 9 only).at n=47A107665
- Semiprimes (A001358) made of nontrivial runs of identical digits.at n=11A116063
- a(n) = 5*n^2 - 1.at n=29A134538
- Numbers k such that the sum of the digits of k^2 is 10. Multiples of 10 are omitted.at n=16A135027
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 4 and 9.at n=46A136821
- 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, -1, -1), (-1, -1, 1), (-1, 1, 1), (1, 0, -1), (1, 1, 0)}.at n=8A148752
- 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, -1, 0), (-1, 0, 0), (0, 1, 1), (1, 0, -1), (1, 1, -1)}.at n=8A148926
- 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, -1, 0), (-1, 0, -1), (1, 0, 0), (1, 0, 1), (1, 1, 1)}.at n=6A151174
- Numbers k >= 1 such that k^2 == 1 (mod 900).at n=39A156840