2349
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
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 3630
- Proper Divisor Sum (Aliquot Sum)
- 1281
- 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
- 1512
- Möbius Function
- 0
- Radical
- 87
- Omega Function (Ω)
- 5
- 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
- 120
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = ceiling(n*phi^8), where phi is the golden ratio, A001622.at n=50A004963
- Coordination sequence T1 for Zeolite Code KFI.at n=37A008123
- Coordination sequence T2 for Zeolite Code NES.at n=31A008206
- Coordination sequence T3 for Zeolite Code RUT.at n=32A009899
- Coordination sequence T1 for Zeolite Code ZON.at n=34A009919
- a(n) = n^2 + 3*n - 1.at n=47A014209
- Number of 1's in n-th term of A006711.at n=29A022477
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-9).at n=18A023439
- Ternary expansion uses each positive digit just once.at n=46A023741
- a(n) = floor((1/n)*(S(n,1) + S(n,2) + ... + S(n,n))), where S(i,j) are Stirling numbers of second kind.at n=8A024426
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A014306.at n=29A025110
- Composites that use the same digits as their prime factorization.at n=3A025283
- Golc sequence in base 2. Left to right concatenation of n,int(log_2(n)),int(log_2(int(log_2(n)))),... in base 2.at n=35A028432
- 1 together with numbers of the form p*q^4 and p^9, where p and q are distinct primes.at n=45A030628
- Cube root of A030690.at n=35A030691
- Integer part of decimal 'base-2 looking' numbers divided by their actual base-2 values (denominator of a(n) is n, numerator is n written in binary but read in decimal).at n=42A032532
- Numbers whose set of base-5 digits is {3,4}.at n=33A032829
- Every run of digits of n in base 8 has length 2.at n=32A033006
- Coordination sequence T3 for Zeolite Code SBE.at n=39A033606
- a(n) is the smallest number such that the product a(1)a(2)...a(n) falls between a twin prime pair, starting with a(1)=2.at n=53A036014