1455
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2352
- Proper Divisor Sum (Aliquot Sum)
- 897
- 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
- 768
- Möbius Function
- -1
- Radical
- 1455
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 140
- 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
- a(n) = 14*a(n-1) - a(n-2) + 6 for n>1, a(0)=0, a(1)=7.at n=3A001921
- Number of permutation groups of degree n (or, number of distinct subgroups of symmetric group S_n, counting conjugates as distinct).at n=6A005432
- a(n) = a(n-1) + a(n-6), with a(i) = 1 for i = 0..5.at n=32A005708
- 11*n^2 + 11*n + 3.at n=11A006222
- Coordination sequence T3 for Zeolite Code BRE.at n=25A008060
- Coordination sequence T5 for Zeolite Code MTW.at n=25A008200
- Molien series for A_10.at n=25A008633
- Number of partitions of n into at most 10 parts.at n=25A008639
- Numbers k such that the geometric mean of phi(k) and sigma(k) is an integer.at n=19A011257
- G.f.: (1+x)*(1+x^3)*(1+x^5)*(1+x^7)*(1+x^9)/((1-x^2)*(1-x^4)*(1-x^6)*(1-x^8)*(1-x^10)).at n=42A014670
- Geometric mean of phi(n) and sigma(n) is an integer, n odd.at n=8A015705
- Expansion of 1/(1 - x^6 - x^7 - x^8 - ...).at n=38A017900
- a(n) = n*(13*n - 1)/2.at n=15A022270
- a(n) = n*(29*n + 1)/2.at n=10A022287
- Number of partitions of n into 10 unordered relatively prime parts.at n=25A023030
- Numbers with exactly 5 2's in their ternary expansion.at n=22A023703
- 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=34A024696
- a(n) = Sum_{k=0..floor(n/2)} T(n-k,k), T given by A026780.at n=13A026790
- Number of partitions of n in which the greatest part is 10.at n=35A026816
- Number of partitions of n into distinct parts, the greatest being odd.at n=47A026837