5270
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
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 10368
- Proper Divisor Sum (Aliquot Sum)
- 5098
- 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
- 1920
- Möbius Function
- 1
- Radical
- 5270
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 54
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that 15*2^k - 1 is prime.at n=29A002237
- Numbers k such that 2*3^k - 1 is prime.at n=21A003307
- Numbers that are the sum of 9 positive 7th powers.at n=26A003376
- Cubes written in base 8.at n=13A004638
- Sum of orders of all 2 X 2 matrices with entries mod n.at n=4A006045
- Expansion of a cusp form of weight 8 for Gamma_1(6).at n=12A006354
- Coordination sequence T1 for Scapolite.at n=46A008262
- Sum along upward diagonal of Pascal triangle from (but not including) halfway point.at n=20A010758
- Number of nondecreasing sequences that are differences of two permutations of 1,2,...,n.at n=8A019589
- a(n) = n*(11*n - 1)/2.at n=31A022268
- Fibonacci sequence beginning 1, 22.at n=13A022392
- T(n, 2n-8), T given by A027926.at n=10A027931
- a(n) = T(2*n, n+3), T given by A027935.at n=4A027939
- Greatest number in row n of array T given by A027935.at n=14A027945
- Greatest number in row n of array T given by A027926.at n=14A027988
- Number of identity bracelets of n beads of 5 colors.at n=6A032242
- Positive numbers having the same set of digits in base 9 and base 10.at n=22A037443
- Numbers whose base-4 representation contains exactly four 1's and two 2's.at n=28A045107
- Erroneous version of A006045 (I think!).at n=5A048690
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=14A049892