13099
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13100
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13098
- Möbius Function
- -1
- Radical
- 13099
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 50
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1558
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Discriminants of imaginary quadratic fields with class number 23 (negated).at n=29A046020
- a(n) is the number of different graphs drawn in the following way: you decide for each number k <= n on a pair of positive numbers (x(k),y(k)) such that x(k)+y(k)=k; you draw n points numbered 1 to n; draw two arrows from n, one to x(n) and one to y(n); draw two arrows from each k already reached by an arrow, one to x(k) and one to y(k). The process stops when 1 is the only point reached by an arrow without any arrow leaving it; you can also erase the isolated points.at n=16A058050
- Primes p such that x^59 = 2 has no solution mod p.at n=29A059312
- Denoting 5 consecutive primes by p, q, r, s and t, these are the values of q such that q, r and s have 10 as a primitive root, but p and t do not.at n=27A060261
- Smallest prime equal to the sum of 2n+1 consecutive primes.at n=37A070934
- Primes which are the sum of the first k odd primes for some k.at n=9A071151
- Smallest odd prime that is the sum of 2n+1 consecutive primes.at n=37A082244
- Numbers k such that if P = 10*k^2+1, then P, P+6, P+12 and P+18 are all primes.at n=35A092446
- Prime(p)-4 for primes p such that prime(p) - 4 is prime.at n=34A094069
- Primes of the form 100n - 1.at n=37A095995
- Smallest prime equal to the sum of exactly 2n+1 distinct odd primes.at n=37A100694
- Smallest odd prime p such that n = (p - 1) / ord_p(2).at n=36A101208
- Primes p equal to the sum of two successive sexy primes - 1 such that p - 6 is also prime.at n=24A104047
- Number of permutations of length n which avoid the patterns 2314, 2431, 4123.at n=9A116786
- Expansion of x^2*(1+3*x+x^2-x^3+28*x^4+80*x^5)/(1-10*x^2+29*x^4-24*x^6).at n=10A122023
- Primes of the form 2*3*5*7*n+79.at n=30A141563
- Primes congruent to 20 mod 41.at n=39A142217
- Primes congruent to 27 mod 43.at n=38A142276
- Primes congruent to 33 mod 47.at n=35A142384
- Primes congruent to 16 mod 49.at n=33A142427