5447
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5880
- Proper Divisor Sum (Aliquot Sum)
- 433
- 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
- 5016
- Möbius Function
- 1
- Radical
- 5447
- 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
- 98
- 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
- a(0) = 1, a(n) = 5*n^2 + 2 for n>0.at n=33A010001
- Numbers that are the sum of 4 distinct positive cubes in exactly 3 ways.at n=26A025410
- Numbers that are the sum of 4 distinct positive cubes in 3 or more ways.at n=28A025413
- Upper members of a "good pair" of the form (k, 2*k +- 1).at n=36A046862
- a(n) = 1 + Sum_{i=1..n} phi(i)^2.at n=33A049454
- Matrix 10th power of partition triangle A008284.at n=30A050304
- Smallest integer in Recamán's sequence (A005132) to appear n times.at n=5A064369
- a(n) = (3*4^n - 2*3^n + 2^n)/2.at n=6A083330
- Pseudo-random numbers: MS C 6.0 version.at n=30A084275
- a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + sum of the unique prime factors of a(n).at n=17A096460
- Number of n-vertex unlabeled mating graphs (cf. A006024) without endpoints.at n=7A101390
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 1), (0, 0, -1), (1, -1, 1), (1, 1, 1)}.at n=7A149706
- Numerator of Euler(n, 1/28).at n=3A157206
- Partial sums of A004207.at n=37A176718
- Number of partitions of n having no parts with multiplicity 10.at n=30A184645
- a(n+1) is the sum of a(n) and the prime factors of a(n), counted with multiplicity. Start with a(0) = 3.at n=15A192896
- G.f. A(x) satisfies A(x) = (1 + x*A(x))*(1 + x^3*A(x)^4).at n=10A198888
- Number of 0..n arrays x(0..3) of 4 elements with nondecreasing average value and 0..n occur with instance counts within one of each other.at n=14A200943
- Principal diagonal of the convolution array A213836.at n=12A213837
- G.f. satisfies: A(x) = (1 + x*(1-x)*A(x)) * (1 + x^2*A(x)^2).at n=11A216616