1434
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2880
- Proper Divisor Sum (Aliquot Sum)
- 1446
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 476
- Möbius Function
- -1
- Radical
- 1434
- 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
- 34
- 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 even number that is an unordered sum of two odd primes in exactly n ways.at n=50A001172
- Numbers k such that the k-th tetrahedral number is the sum of 2 tetrahedral numbers.at n=38A002311
- Number of vertex-transitive graphs with n nodes.at n=26A006799
- Coordination sequence T5 for Zeolite Code NES.at n=24A008209
- Coordination sequence T1 for Scapolite.at n=24A008262
- Number of partitions of n into parts >= 4.at n=45A008484
- Number of increasing sequences of Goldbach type of length n; a(0) = 1 by convention.at n=7A008932
- A B_2 sequence: a(n) = least value such that the sequence increases and pairwise sums of distinct terms are all distinct.at n=32A010672
- a(n) = (2*n)! * D_{2*n}, where D_{2*n} = (1/Pi) * Integral_{x=0..oo} [1 - x^(2*n) / Product_{j=1..n} (x^2+j^2)] dx.at n=2A013926
- Number of vectors abcdefg with a,b,... >= 0, a+...+g=n, a>={b,...g}.at n=10A014073
- Numbers k such that the continued fraction for sqrt(k) has period 28.at n=19A020367
- Expansion of Product_{m>=1} 1/(1 + m*q^m).at n=20A022693
- Smallest positive even integer that is an unordered sum of two primes in exactly n ways.at n=50A023036
- Positive numbers k such that k and 3*k are anagrams in base 9 (written in base 9).at n=13A023080
- a(n) = position of 3*n^2 in sequence A025051 (numbers of form j*k + k*i + i*j, without repetitions, where 1 <= i <= j <= k).at n=21A025056
- Numbers that are the sum of 3 distinct nonzero squares in exactly 8 ways.at n=44A025346
- Number of partitions of n in which the least part is 4.at n=48A026797
- Number of partitions of n that do not contain 4 as a part.at n=26A027338
- Coordination sequence T1 for Zeolite Code CGS.at n=28A027365
- 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 12.at n=44A031510