2314
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 3780
- Proper Divisor Sum (Aliquot Sum)
- 1466
- 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
- 1056
- Möbius Function
- -1
- Radical
- 2314
- 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
- no
- Collatz Steps
- 32
- 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
- a(n) = 3^n + 2^n - 1.at n=7A005056
- Number of points on surface of tetrahedron; coordination sequence for sodalite net (equals 2*n^2+2 for n > 0).at n=34A005893
- Coordination sequence T6 for Zeolite Code EUO.at n=30A008101
- Coordination sequence for body-centered tetragonal lattice.at n=17A008527
- Continued fraction for cube root of 62.at n=12A010291
- Numbers k such that the continued fraction for sqrt(k) has period 21.at n=17A020360
- Fibonacci sequence beginning 0, 26.at n=11A022360
- Numbers k such that Fibonacci(k) == -3 (mod k).at n=32A023164
- a(n) = T(2n-1,n), where T is the array in A026098.at n=23A026102
- Decimal representation of permutations of lengths 1, 2, 3, ... arranged lexicographically.at n=17A030299
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 5.at n=15A031418
- Numbers whose set of base-6 digits is {1,4}.at n=43A032818
- Fractional part of square root of a(n) starts with 1: first term of runs.at n=45A034107
- Numbers that eventually reach 1 under "x -> sum of cubes of digits of x".at n=39A035504
- Number of partitions in parts not of the form 17k, 17k+1 or 17k-1. Also number of partitions with no part of size 1 and differences between parts at distance 7 are greater than 1.at n=34A035962
- Numbers having three 4's in base 6.at n=29A043387
- Numbers k such that the string 5,1 occurs in the base 9 representation of k but not of k-1.at n=31A044297
- Numbers n such that string 1,4 occurs in the base 10 representation of n but not of n-1.at n=26A044346
- Numbers n such that string 5,1 occurs in the base 9 representation of n but not of n+1.at n=31A044678
- Numbers n such that string 1,4 occurs in the base 10 representation of n but not of n+1.at n=26A044727