2358
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 5148
- Proper Divisor Sum (Aliquot Sum)
- 2790
- 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
- 780
- Möbius Function
- 0
- Radical
- 786
- Omega Function (Ω)
- 4
- 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
- 58
- 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
- Representation degeneracies for Ramond strings.at n=16A005303
- Coordination sequence T1 for Coesite.at n=26A008267
- a(n+1) = a(n)-b(n+1) if a(n) >= b(n+1) else a(n)+b(n+1), where {b(n)} are the triangular numbers A000217.at n=50A008345
- Aliquot sequence starting at 180.at n=9A008891
- Coordination sequence T2 for Zeolite Code DFO.at n=37A009876
- Coordination sequence T5 for Zeolite Code DFO.at n=37A009879
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).at n=17A024590
- Coordination sequence T1 for Zeolite Code MWW.at n=32A024986
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=16A025104
- Sequence satisfies T^2(a)=a, where T is defined below.at n=46A027589
- a(n) = n^2 + n + 6.at n=48A027691
- Terminating decimals of length n of form p/5^q using at most one of each nonzero digit.at n=5A027905
- 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 48.at n=6A031546
- Number of ways to partition n elements into pie slices each with an odd number of elements allowing the pie to be turned over.at n=23A032277
- Number of ways to partition n elements into pie slices each with at least 2 elements allowing the pie to be turned over.at n=23A032278
- Arrange digits of cubes in ascending order.at n=18A032553
- Every run of digits of n in base 8 has length 2.at n=33A033006
- Decimal part of a(n)^(1/3) starts with reversal of its integer part: first term of runs.at n=11A034309
- Limit of the position of the n-th partition into parts 5k+2 or 5k+3 in the list of all integer partitions sorted in reverse lexicographic order, for integers == 3 (mod 5).at n=45A035408
- Numbers n such that BCR(n) = n, where BCR = binary-complement-and-reverse = take one's complement then reverse bit order.at n=35A035928