11013
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14688
- Proper Divisor Sum (Aliquot Sum)
- 3675
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7340
- Möbius Function
- 1
- Radical
- 11013
- 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
- 130
- 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(n) = floor(sinh(n)).at n=10A000471
- Nearest integer to sinh(n).at n=10A000495
- a(n) = floor(cosh(n)).at n=10A000501
- Squares written in base 6.at n=39A001741
- Nearest integer to cosh(n).at n=10A002459
- a(n) = Fibonacci(n+2) + prime(n).at n=18A004399
- An "extremely strange sequence": a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p dividing [ A*a(n)+B ] and p=2, A=4.001, B=1.2.at n=35A028948
- Numbers that, when expressed in base 7 and then interpreted in base 10, yield a multiple of the original number.at n=28A032549
- Number of asymmetric mobiles (circular rooted trees) with n nodes and 4 leaves.at n=12A055365
- Coefficients of monic primitive irreducible polynomials over GF(5) listed in lexicographic order.at n=34A058950
- Coefficients of monic primitive irreducible polynomials over GF(4) listed in lexicographic order.at n=27A058952
- Numbers k that, when expressed in base 7 and then interpreted in base 10, give a multiple of k.at n=29A062944
- Partial sums of A081660.at n=13A081661
- a(1) = 9, then the smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).at n=24A083995
- Numbers k such that k, k+2, k+4, k+6, k+8 are semiprimes.at n=35A092127
- Numbers k such that k, k+2, k+4, k+6, k+8, k+10 are semiprimes.at n=12A092128
- Numbers beginning with a vowel in French.at n=15A118557
- a(n) = prime(n) * prime(n+2) - 2 * prime(n+1).at n=26A152532
- Cyclops semiprimes.at n=25A160725
- Odd cyclops numbers.at n=46A162199