4270
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 8928
- Proper Divisor Sum (Aliquot Sum)
- 4658
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1440
- Möbius Function
- 1
- Radical
- 4270
- 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
- 64
- 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
- G.f.: (1+x)^2/[(1-x)^4(1-x-x^2)^3].at n=6A001926
- Primitive pseudoperfect numbers.at n=59A006036
- Fibonacci sequence beginning 0, 7.at n=15A022090
- a(n) = n*(7*n - 1)/2.at n=35A022264
- Sum of [ S(n,m)/C(n-1,m-1) ] for m = 1,2,...,n; S(n,m) are Stirling numbers of second kind.at n=10A024423
- Numbers with exactly five distinct base-8 digits.at n=10A031985
- Numbers whose set of base-11 digits is {2,3}.at n=24A032811
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=30A050036
- a(n) = 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) = 1, a(2) = 2, and a(3) = 4.at n=30A050052
- a(n) = a(n-1) + a(m) for n >= 3, 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) = 1 and a(2) = 3.at n=30A050068
- Number of 2 X 2 matrices with elements from {0,1,2,...,n} and with Nim-Determinant 1. (The Nim-Determinant of the 2 X 2 matrix [a,b; c,d] is defined to be a*d xor b*c, where * denotes Nim-Multiplication.)at n=16A059954
- In base 4, smallest number that requires n Reverse and Add! steps to reach a palindrome.at n=25A077441
- Matrix product of Stirling2-triangle A008277(n,k) and unsigned Stirling1-triangle |A008275(n,k)|.at n=24A079641
- Arrange n^2 octagons that each have area 7 so that they leave (n-1)^2 square gaps each with area 2; a(n) is the total area of these polygons.at n=21A086640
- Triangle read by rows: T(n,m) = number of T_0-multigraphs with n edges and m vertices(n>=2, 3<=m<=2*n).at n=22A093855
- Indices of primes in sequence defined by A(0) = 83, A(n) = 10*A(n-1) - 7 for n > 0.at n=18A101062
- Positive integers n such that n^17 + 1 is semiprime (A001358).at n=40A104494
- Integers k such that 10^k - 33 is prime.at n=22A108364
- Rare pseudoperfect (or semiperfect) numbers, that is, pseudoperfect numbers k such that k == 2 or 10 (mod 12).at n=36A109761
- Rare primitive pseudoperfect numbers: primitive pseudoperfect numbers k such that k == 2 or 10 (mod 12).at n=30A109762