3155
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3792
- Proper Divisor Sum (Aliquot Sum)
- 637
- 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
- 2520
- Möbius Function
- 1
- Radical
- 3155
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 92
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Mian-Chowla sequence (a B_2 sequence): a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise sums of elements are all distinct.at n=41A005282
- x^3 + n*y^3 = 1 is solvable.at n=46A005988
- Coordination sequence T2 for Zeolite Code AWW.at n=40A008046
- Coordination sequence T8 for Zeolite Code EUO.at n=35A008103
- Crystal ball sequence for planar net 3.6.3.6.at n=37A008580
- Powers of cube root of 3 rounded up.at n=22A017984
- Powers of cube root of 9 rounded up.at n=11A018002
- a(n) = sum of the numbers between the two n's in A026366.at n=29A026369
- Sums of distinct powers of 5.at n=38A033042
- Number of binary rooted trees with n nodes and height at most 8.at n=14A036591
- Positive numbers having the same set of digits in base 2 and base 5.at n=34A037410
- Coordination sequence T3 for Zeolite Code SFF.at n=37A038433
- Sums of 3 distinct powers of 5.at n=12A038475
- Base-4 palindromes that start with 3.at n=27A043005
- Numbers k such that the string 8,5 occurs in the base 9 representation of k but not of k-1.at n=42A044328
- Numbers n such that string 5,5 occurs in the base 10 representation of n but not of n-1.at n=31A044387
- Numbers n such that string 8,5 occurs in the base 9 representation of n but not of n+1.at n=42A044709
- Numbers n such that string 5,5 occurs in the base 10 representation of n but not of n+1.at n=31A044768
- Numbers whose base-5 representation contains exactly three 0's and three 1's.at n=2A045172
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(4) = 4.at n=12A049930