359
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 360
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 358
- Möbius Function
- -1
- Radical
- 359
- 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
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
- yes
- Safe Prime
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 72
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- dreihundertneunundfünfzig· ordinal: dreihundertneunundfünfzigste
- English
- three hundred fifty-nine· ordinal: three hundred fifty-ninth
- Spanish
- trescientos cincuenta y nueve· ordinal: 359º
- French
- trois cent cinquante-neuf· ordinal: trois cent cinquante-neufième
- Italian
- trecentocinquantanove· ordinal: 359º
- Latin
- trecenti quinquaginta novem· ordinal: 359.
- Portuguese
- trezentos e cinquenta e nove· ordinal: 359º
Appears in sequences
- Shifts 2 places left under binomial transform.at n=9A000994
- Union of all numbers {p, q} where p and q are both primes or powers of primes and q = p+2.at n=58A001092
- Primes with 7 as smallest primitive root.at n=3A001126
- Primes == +-1 (mod 8).at n=32A001132
- A generalized Fibonacci sequence.at n=35A001584
- Indices of prime Fibonacci numbers.at n=14A001605
- The coding-theoretic function A(n,4,3).at n=46A001839
- Cyclic numbers: 10 is a quadratic residue modulo p and class of mantissa is 2.at n=21A001914
- Primes p such that the congruence 2^x == 3 (mod p) is solvable.at n=41A001915
- Primes p such that the congruence 2^x = 5 (mod p) is solvable.at n=38A001916
- Primes of the form 4*k + 3.at n=36A002145
- Primitive roots that go with the primes in A002230.at n=35A002229
- Let p = A007645(n) be the n-th generalized cuban prime and write p^2 = x^2 + 3*y^2 with y > 0; a(n) = x.at n=33A002367
- Lucasian primes: p == 3 (mod 4) with 2*p+1 prime.at n=9A002515
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*(1-x^4)).at n=16A002621
- Numbers that are the sum of 3 positive cubes.at n=47A003072
- Positions of letter c in the tribonacci word abacabaabacababac... generated by a->ab, b->ac, c->a (cf. A092782).at n=57A003146
- Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).at n=20A003147
- Numbers that are the sum of 9 positive 4th powers.at n=37A003343
- Add 4, then reverse digits; start with 0.at n=29A003608