15753
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21600
- Proper Divisor Sum (Aliquot Sum)
- 5847
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10208
- Möbius Function
- -1
- Radical
- 15753
- 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
- yes
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- yes
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 102
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers that are the sum of 3 nonzero 6th powers.at n=22A003359
- Numbers that are the sum of at most 3 nonzero 6th powers.at n=40A004854
- Composite n such that phi(n) * sigma(n) is one less than a square.at n=39A015709
- Odd composite n such that phi(n) * sigma(n) is one less than a square.at n=16A015722
- Number of 7 X 7 binary matrices with n=0..49 ones up to row and column permutations.at n=12A053304
- a(n) = 25*n*(n + 1)/2 + 3.at n=35A061793
- Triangular numbers with sum of digits = 21.at n=12A068131
- Triangular numbers which are also happy numbers (cf. A007770).at n=26A076712
- Smallest triangular number > 1 and == 1 (mod prime(n)).at n=40A087397
- a(n) = Fibonacci(n)*(2*Fibonacci(n)-1).at n=11A095122
- Number of planar partitions of n where parts strictly decrease along each row and column.at n=28A114736
- Triangular numbers for which the sum of the digits is an octagonal number.at n=15A117523
- Triangular numbers with only odd digits.at n=16A117960
- Hexagonal numbers with prime indices.at n=23A117961
- Triangular numbers that can be written as sum of three positive cubes.at n=34A119977
- Triangular numbers that are products of three distinct primes.at n=42A128896
- Triangular numbers n*(n+1)/2 with n and n+1 composite, where number of prime factors in n = number of prime factors in n+1. (Prime factors are counted with multiplicity.)at n=33A144486
- a(n) = n^3 + sum((-1)^j*a(j)); for j=1 to n-1; a(1)=1.at n=42A153286
- a(n) = n^3/6 + 3*n^2/4 + 7*n/3 + 7/8 + (-1)^n/8.at n=44A173154
- Number of distinct finite languages over 3-ary alphabet, whose minimum regular expression has ordinary length n.at n=7A211952