1425
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 2480
- Proper Divisor Sum (Aliquot Sum)
- 1055
- 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
- 720
- Möbius Function
- 0
- Radical
- 285
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 26
- 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
- Number of partitions of n into at most 4 parts.at n=54A001400
- a(n) = a(n-2) + a(n-3) + a(n-4), with initial values a(0) = 0, a(1) = 2, a(2) = 3, a(3) = 6.at n=18A001634
- Generalized divisor function. Number of partitions of n with exactly three part sizes.at n=26A002134
- Fibonacci numbers written in base 6.at n=14A004689
- Number of connected vertex-transitive graphs with n nodes.at n=26A006800
- Discriminants of totally real cubic fields.at n=40A006832
- Number of n-node animals on f.c.c. lattice.at n=5A007199
- Coordination sequence T2 for Zeolite Code APD.at n=25A008035
- Number of partitions of 2*n into at most 4 parts.at n=27A014126
- a(n) = n^2 - floor( n/2 ).at n=38A014848
- Expansion of 1/(1-x^4-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12).at n=29A017834
- a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=1 a(2)=3; where c( ) is complement of a( ).at n=47A022947
- a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=2, a(2)=3; where c( ) is complement of a( ).at n=47A022951
- Index of 6^n within the sequence of the numbers of the form 3^i*6^j.at n=41A025713
- Number of partitions of n into an even number of parts, the least being 3; also, a(n+3) = number of partitions of n into an odd number of parts, each >=3.at n=45A027195
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 19 (most significant digit on left).at n=28A029464
- Numbers k such that k-2 and k+2 are consecutive primes.at n=47A029708
- Exactly 4 digits from {1,2,3,4,5,6,7,8,9} can precede a(n) to form a lucky number.at n=46A032700
- Trajectory of 1 under map n->11n+1 if n odd, n->n/2 if n even.at n=12A033963
- a(n) = n*(4*n-1).at n=19A033991