385
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 576
- Proper Divisor Sum (Aliquot Sum)
- 191
- 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
- -1
- Radical
- 385
- 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
- 32
- Smith 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
Names
- German
- dreihundertfünfundachtzig· ordinal: dreihundertfünfundachtzigste
- English
- three hundred eighty-five· ordinal: three hundred eighty-fifth
- Spanish
- trescientos ochenta y cinco· ordinal: 385º
- French
- trois cent quatre-vingt-cinq· ordinal: trois cent quatre-vingt-cinqième
- Italian
- trecentoottantacinque· ordinal: 385º
- Latin
- trecenti octoginta quinque· ordinal: 385.
- Portuguese
- trezentos e oitenta e cinco· ordinal: 385º
Appears in sequences
- a(n) is the number of partitions of n (the partition numbers).at n=18A000041
- Number of positive integers <= 2^n of form x^2 + 2 y^2.at n=10A000067
- a(n) = floor(n^(3/2)).at n=53A000093
- a(n) = floor(n^2/3).at n=34A000212
- Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n*(n+1)*(2*n+1)/6.at n=10A000330
- Numbers m such that Fibonacci(m) ends with m.at n=18A000350
- Coefficients of ménage hit polynomials.at n=3A000450
- Expansion of Product_{k>=0} (1 + x^(2k+1)); number of partitions of n into distinct odd parts; number of self-conjugate partitions; number of symmetric Ferrers graphs with n nodes.at n=69A000700
- Euler's "numerus idoneus" (or "numeri idonei", or idoneal, or suitable, or convenient numbers).at n=56A000926
- Generalized octagonal numbers: k*(3*k-2), k=0, +- 1, +- 2, +-3, ...at n=22A001082
- a(n) is the solution to the postage stamp problem with n denominations and 3 stamps.at n=14A001213
- Number of permutations of length n with 4 consecutive ascending pairs.at n=7A001260
- Coordination sequence for hyperbolic tessellation 3^7 (from triangle group (2,3,7)).at n=5A001354
- a(n) = 1^n + 2^n + ... + 10^n.at n=2A001557
- n-phi-torial, or phi-torial of n: Product k, 1 <= k <= n, k relatively prime to n.at n=11A001783
- The coding-theoretic function A(n,4,4).at n=18A001843
- Triangular numbers plus quarter-squares: n*(n+1)/2 + floor((n+1)^2/4) (i.e., A000217(n) + A002620(n+1)).at n=22A001859
- Numbers dividing A002037(i) and larger than A002037(i-1), for some i>0.at n=33A002038
- Cullen numbers: a(n) = n*2^n + 1.at n=6A002064
- Generalized divisor function. Number of partitions of n with exactly three part sizes.at n=16A002134