5558
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9552
- Proper Divisor Sum (Aliquot Sum)
- 3994
- 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
- 2376
- Möbius Function
- -1
- Radical
- 5558
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 160
- 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
- Generalized divisor function. Number of partitions of n with exactly three part sizes.at n=43A002134
- Expansion of 1/((1-3x)(1-5x)(1-6x)(1-11x)).at n=3A028057
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=19A034076
- Numbers having three 6's in base 8.at n=30A043447
- Numbers having three 5's in base 9.at n=30A043475
- Numbers having three 5's in base 10.at n=22A043511
- Numbers n such that 155*2^n-1 is prime.at n=14A050619
- Values of n such that 90n+11, 90n+13, 90n+17, 90n+19 are all primes.at n=36A051897
- 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=24A059954
- a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=2.at n=8A067975
- Smallest number with digital product = 10^n.at n=3A089386
- Smallest number which requires n iterations to reach a prime when iterating x + sum of squares of digits of x.at n=35A094658
- Records in A068189 (smallest number k such that n = product of nonzero digits of k, or 0 if no such k exists).at n=41A096867
- Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 1 that start at an odd level.at n=38A102405
- Number of Dyck paths of semilength n having no ascents of length 1 that start at an odd level.at n=10A102407
- Site percolation series for 4.8 (bathroom tile) lattice.at n=31A120557
- 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), (-1, 1, 1), (0, 1, -1), (1, 0, 0)}.at n=9A148256
- Indices of primes in the Padovan sequence A000931.at n=19A152870
- a(n) = 343*n - 273.at n=16A157369
- Numerator of Bernoulli(n,4).at n=7A157920