11558
domain: N
Properties
Digital Properties
- Digit Count
- 5
- 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
- 17340
- Proper Divisor Sum (Aliquot Sum)
- 5782
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5778
- Möbius Function
- 1
- Radical
- 11558
- 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
- 143
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026692.at n=13A026700
- Number of excursions of length n on the upper-right part of the hexagonal lattice.at n=9A057648
- a(n) = A078152(2^n).at n=24A078157
- Pierce expansion of 1/e^2.at n=10A091832
- Difference between the n-th partial sum of the squares (A000330) and the n-th partial sum of the primes (A007504).at n=33A108753
- Sets of digits such that the product of the digits is 10 times the sum of the digits. Each set is arranged as a number with nondecreasing digits.at n=4A124694
- a(1)=a(2)=1. a(n+1) = a(n) + a(largest prime dividing n).at n=37A128215
- Largest number not the sum of n distinct nonzero squares.at n=26A129210
- 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, 0, 1), (0, 0, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150799
- a(n) = the smallest positive integer that, when written in binary, contains both binary n and binary n^2 as substrings.at n=37A165820
- 3-comma numbers: n occurs in the sequence S[k+1]=S[k]+10*last_digit(S[k-1])+first_digit(S[k]) for three different splittings n=concat(S[0],S[1]).at n=5A166513
- Number of 6 X 6 0..n matrices with each 2 X 2 subblock idempotent.at n=35A224668
- Floor(AGM(n^2, n^3)), where AGM denotes the arithmetic-geometric mean.at n=33A234362
- Number of partitions p of n such that (number of numbers of the form 3k+1 in p) is a part of p.at n=36A241547
- Indices of primes in the hexanacci numbers sequence A000383.at n=26A247192
- Numbers n for which the digital sum contains the same distinct digits as the digital product but the digital sum is not equal to the digital product.at n=19A249335
- Number of times prime(n) occurs as the least prime factor among numbers 1 .. prime(n)^4: a(n) = A078898(A030514(n)).at n=13A250478
- Numbers whose base phi representation is symmetrical with respect to the radix point.at n=33A330672
- Positive integers k with digits in nondecreasing order for which the digital sum contains the same distinct digits as the digital product.at n=18A338257
- Positive integers with digits in nondecreasing order for which the digital sum contains the same distinct digits as the digital product but the digital sum is not equal to the digital product.at n=3A338258