11139
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15360
- Proper Divisor Sum (Aliquot Sum)
- 4221
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7176
- Möbius Function
- -1
- Radical
- 11139
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = 10000*log_10(n) rounded down.at n=12A004228
- a(n) = 10000*log_10(n) rounded to the nearest integer.at n=12A004229
- Number of partitions of 5n such that cn(0,5) = cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5).at n=12A036884
- a(n) = a(n-1) + (sum of the terms, from among the first (n-1) terms of the sequence, which are coprime to the n-th Fibonacci number).at n=12A131788
- Lexicographically earliest increasing sequence which lists the positions of the zero digits in the sequence.at n=31A167519
- Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (3,n)-rectangular grid with k '1's and (3n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=59A226290
- Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (3,n)-rectangular grid with k '1's and (3n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=61A226290
- Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (6,n)-rectangular grid with k '1's and (6n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=29A228165
- Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (6,n)-rectangular grid with k '1's and (6n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=31A228165
- Lexicographically earliest sequence of distinct terms such that a(n) is divisible by five and only five digits of a(n+1).at n=24A308609
- a(n) is the smallest number whose name in Bengali has n letters, or -1 if no such word exists.at n=12A353043
- Numbers k such that the sum of the first k greater of twin primes is a greater of twin prime.at n=41A376892
- Consecutive states of the linear congruential pseudo-random number generator (1093*s + 18257) mod 86436 when started at s=1.at n=22A385340