1535
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
- 1848
- Proper Divisor Sum (Aliquot Sum)
- 313
- 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
- 1224
- Möbius Function
- 1
- Radical
- 1535
- 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
- 60
- 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
- Number of partitions into non-integral powers.at n=20A000148
- A nonlinear recurrence.at n=30A003073
- Coordination sequence T1 for Zeolite Code ATV.at n=25A008043
- exp(arcsinh(x)+arctan(x))=1+2*x+4/2!*x^2+5/3!*x^3-8/4!*x^4-55/5!*x^5...at n=7A013103
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite BEA = Beta Na7[Al7Si57O128] starting with a T9 atom.at n=10A019075
- Numbers k such that Fibonacci(k) == -5 (mod k).at n=43A023165
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A014306, t = (primes).at n=35A024696
- Index of 10^n within the sequence of the numbers of the form 7^i*10^j.at n=50A025745
- Binary expansion contains a single 0.at n=46A030130
- Cube root of A030690.at n=18A030691
- Numbers k such that the continued fraction for sqrt(k) has even period 2*m and the m-th term of the periodic part is 7.at n=24A031410
- Numbers whose base-4 representation has 4 fewer 0's than 3's.at n=11A031469
- OR-convolution of squares A000290 with themselves.at n=12A033459
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 3 (mod 4).at n=32A035550
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 4 (mod 5).at n=44A035574
- A035550 with periodic zeros stripped.at n=15A035595
- Number of partitions in parts not of the form 15k, 15k+1 or 15k-1. Also number of partitions with no part of size 1 and differences between parts at distance 6 are greater than 1.at n=32A035955
- Number of partitions of n into parts not of the form 23k, 23k+2 or 23k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 10 are greater than 1.at n=28A035990
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+3 or 24k-3. Also number of partitions in which no odd part is repeated, with 1 part of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=38A036030
- Number of odd nonprimes < (2n+1)^2.at n=32A037040