2398
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 3960
- Proper Divisor Sum (Aliquot Sum)
- 1562
- 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
- 1080
- Möbius Function
- -1
- Radical
- 2398
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 71
- 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
- Smallest multiple of n whose digits sum to n.at n=22A002998
- a(n) = 1000*log(n) rounded to the nearest integer.at n=10A004241
- a(n) = ceiling(1000*log(n)).at n=10A004242
- Coordination sequence T2 for Zeolite Code AEI.at n=37A008002
- Coordination sequence occurring in Zeolite Codes AFG, CAN, LIO, LOS.at n=34A008013
- Coordination sequence T5 for Zeolite Code RSN.at n=32A009889
- Pseudoprimes to base 45.at n=24A020173
- Numbers k such that the continued fraction for sqrt(k) has period 32.at n=33A020371
- a(n) is least k such that k and 7k are anagrams in base n (written in base 10).at n=37A023099
- a(n) = 1^2 + prime(1)^2 + prime(2)^2 + ... + prime(n)^2.at n=10A024525
- Number of different coefficient values in expansion of Product (1+q^1+q^3...+q^(2i-1)), i=1 to n.at n=48A039824
- Base-5 palindromes that start with 3.at n=32A043008
- Numbers whose base-7 representation contains exactly three 6's.at n=22A043419
- Numbers k such that string 5,4 occurs in the base 9 representation of k but not of k-1.at n=32A044300
- Numbers n such that string 9,8 occurs in the base 10 representation of n but not of n-1.at n=25A044430
- Numbers n such that string 5,4 occurs in the base 9 representation of n but not of n+1.at n=32A044681
- Numbers n such that string 9,8 occurs in the base 10 representation of n but not of n+1.at n=25A044811
- Numbers whose base-5 representation contains exactly two 3's and two 4's.at n=37A045302
- Composite numbers whose 3 prime factors are distinct in length.at n=3A046443
- a(n) = T(2n-1,n) + T(2n,n+1) + ... + T(3n-3,2n-2) = sum over a period of n-th diagonal of array T given by A049828.at n=37A049833