3438
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
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 7488
- Proper Divisor Sum (Aliquot Sum)
- 4050
- 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
- 1140
- Möbius Function
- 0
- Radical
- 1146
- 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
- 149
- 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
- MacMahon's generalized sum of divisors function.at n=27A002127
- Coordination sequence T7 for Zeolite Code MTT.at n=36A008195
- Coordination sequence T1 for Cordierite.at n=35A008251
- Concatenation of n and n + 4 or {n,n+4}.at n=33A032609
- Coordination sequence T4 for Zeolite Code STT.at n=39A038417
- Base-8 palindromes that start with 6.at n=15A043026
- Numbers n such that string 3,8 occurs in the base 10 representation of n but not of n-1.at n=38A044370
- Numbers n such that string 3,8 occurs in the base 10 representation of n but not of n+1.at n=38A044751
- Numbers which, when expressed as a sum of distinct primes with maximum product, use a non-maximal number of primes.at n=17A053020
- McKay-Thompson series of class 28D for Monster.at n=25A058609
- Numbers k such that k^2 has property that the sum of its digits and the product of its digits are nonzero squares.at n=37A061268
- Numbers k such that prime(k+1)-(k+1)*tau(k+1) = prime(k-1)-(k-1)*tau(k-1) where tau(k) = A000005(k) is the number of divisors of k.at n=25A067335
- a(n) = (sum of digits of n)^4 - (sum of digits^4 of n).at n=19A069964
- a(1)=1; a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^2.at n=20A071183
- Smallest multiple of the n-th prime such that the n-th partial sum is divisible by n.at n=42A074105
- a(n) = A077706(n+1)/A077706(n).at n=11A077707
- Largest n-digit number minus the product of its digits; i.e., a(n) = 99999... (n 9's) - 9^n.at n=2A083445
- Numbers k such that (k / sum of digits of k) and (k+1 / sum of digits of k+1) are both prime.at n=6A085775
- Triangle read by rows: T(n,k) is number of Dyck paths of semilength n with height of second peak equal to k (n>=1; 0<=k<=n-1).at n=61A112307
- a(1)=1, a(2)=1. a(n) = the sum of the two largest earlier terms which are both coprime to n.at n=48A122457