369
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 546
- Proper Divisor Sum (Aliquot Sum)
- 177
- 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
- 240
- Möbius Function
- 0
- Radical
- 123
- Omega Function (Ω)
- 3
- 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
- 19
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
Names
- German
- dreihundertneunundsechzig· ordinal: dreihundertneunundsechzigste
- English
- three hundred sixty-nine· ordinal: three hundred sixty-ninth
- Spanish
- trescientos sesenta y nueve· ordinal: 369º
- French
- trois cent soixante-neuf· ordinal: trois cent soixante-neufième
- Italian
- trecentosessantanove· ordinal: 369º
- Latin
- trecenti sexaginta novem· ordinal: 369.
- Portuguese
- trezentos e sessenta e nove· ordinal: 369º
Appears in sequences
- Number of free polyominoes (or square animals) with n cells.at n=8A000105
- 6th power of rooted tree enumerator; number of linear forests of 6 rooted trees.at n=4A000395
- Smallest nonnegative number that is the sum of 3 squares in exactly n ways.at n=7A000437
- Powers of rooted tree enumerator.at n=5A000439
- Smallest number that is the sum of 3 squares in at least n ways.at n=7A000451
- Number of equivalence classes of base-3 necklaces of length n, where necklaces are considered equivalent under both rotations and permutations of the symbols.at n=9A002076
- Numbers k for which the rank of the elliptic curve y^2 = x^3 + k is 2.at n=55A002155
- Numbers that are the sum of 4 nonzero 4th powers.at n=20A003338
- Numbers that are the sum of 9 positive 4th powers.at n=38A003343
- Sums of distinct positive cubes.at n=52A003997
- a(n) = 100*log(n) rounded to nearest integer.at n=39A004238
- a(n) = ceiling(100*log(n)).at n=39A004239
- Binary expansion ends 001.at n=45A004768
- Numbers k such that 2*(2k-3)!/(k!*(k-1)!) is an integer.at n=39A004782
- Numbers k such that 3!*(2k-4)!/(k!*(k-1)!) is an integer.at n=49A004783
- Numbers that are the sum of at most 4 nonzero 4th powers.at n=49A004833
- a(n) = round(n*phi^10), where phi is the golden ratio, A001622.at n=3A004945
- a(n) = ceiling(n*phi^10), where phi is the golden ratio, A001622.at n=3A004965
- a(n) = 5^n - 4^n.at n=4A005060
- Record values in A005210.at n=21A005211