387
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
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 572
- Proper Divisor Sum (Aliquot Sum)
- 185
- 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
- 252
- Möbius Function
- 0
- Radical
- 129
- 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
- 120
- 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
- dreihundertsiebenundachtzig· ordinal: dreihundertsiebenundachtzigste
- English
- three hundred eighty-seven· ordinal: three hundred eighty-seventh
- Spanish
- trescientos ochenta y siete· ordinal: 387º
- French
- trois cent quatre-vingt-sept· ordinal: trois cent quatre-vingt-septième
- Italian
- trecentoottantasette· ordinal: 387º
- Latin
- trecenti octoginta septem· ordinal: 387.
- Portuguese
- trezentos e oitenta e sete· ordinal: 387º
Appears in sequences
- Number of graphical partitions of 2n.at n=10A000569
- Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=21A000960
- Smallest number requiring n chisel strokes for its representation in Roman numerals.at n=17A002964
- Numbers k such that 2*3^k - 1 is prime.at n=16A003307
- Numbers that are the sum of 7 positive 4th powers.at n=33A003341
- Numbers that are the sum of 12 positive 4th powers.at n=49A003346
- Numbers that are the sum of 9 positive 6th powers.at n=6A003365
- Numbers that are the sum of 6 positive 7th powers.at n=3A003373
- Divisors of 2^42 - 1.at n=14A003547
- Inconsummate numbers in base 10: no number is this multiple of the sum of its digits (in base 10).at n=21A003635
- Number of partitions of 1/n into 3 reciprocals of positive integers.at n=50A004194
- Divisible only by primes congruent to 3 mod 5.at n=39A004617
- Divisible only by primes congruent to 3 mod 8.at n=39A004626
- Numbers whose binary expansion ends in 011.at n=47A004769
- Numbers that are the sum of at most 9 nonzero 6th powers.at n=48A004860
- Numbers that are the sum of at most 6 positive 7th powers.at n=21A004868
- Numbers that are the sum of at most 7 positive 7th powers.at n=24A004869
- Numbers that are the sum of at most 8 positive 7th powers.at n=27A004870
- Numbers that are the sum of at most 9 positive 7th powers.at n=30A004871
- Numbers that are the sum of at most 10 positive 7th powers.at n=33A004872