147
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 228
- Proper Divisor Sum (Aliquot Sum)
- 81
- 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
- 84
- Möbius Function
- 0
- Radical
- 21
- 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
- 116
- 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
- einshundertsiebenundvierzig· ordinal: einshundertsiebenundvierzigste
- English
- one hundred forty-seven· ordinal: one hundred forty-seventh
- Spanish
- ciento cuarenta y siete· ordinal: 147º
- French
- cent quarante-sept· ordinal: cent quarante-septième
- Italian
- centoquarantasette· ordinal: 147º
- Latin
- centum quadraginta septem· ordinal: 147.
- Portuguese
- cento e quarenta e sete· ordinal: 147º
Appears in sequences
- Number of partitions of n if there are two kinds of 1, two kinds of 2 and two kinds of 3.at n=8A000098
- Positive zeros of Bessel function of order 0 rounded to nearest integer.at n=46A000134
- a(n) = floor(n^2/3).at n=21A000212
- Number of n-node rooted trees of height 3.at n=9A000235
- a(n) = (n+1)*(n+3)*(n+8)/6.at n=7A000297
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^3)).at n=14A000601
- Expansion of Product_{n>=1} (1 - x^n)^7.at n=19A000730
- Expansion of Product_{n>=1} (1 - x^n)^7.at n=38A000730
- Total number of 1's in binary expansions of 0, ..., n.at n=53A000788
- 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=13A000960
- n! never ends in this many 0's.at n=27A000966
- Coordination sequence for hyperbolic tessellation 3^7 (from triangle group (2,3,7)).at n=4A001354
- a(n) is the number of partitions of n into at most 3 parts; also partitions of n+3 in which the greatest part is 3; also number of unlabeled multigraphs with 3 nodes and n edges.at n=39A001399
- Fibonacci entry points: a(n) = smallest m > 0 such that the n-th prime divides Fibonacci(m).at n=61A001602
- Sorting numbers: maximal number of comparisons for sorting n elements by binary insertion.at n=34A001855
- v-pile numbers of the 3-Wythoff game with i=1.at n=34A001958
- v-pile positions of the 4-Wythoff game with i=1.at n=28A001964
- Number of partitions of 3n-1 into n nonnegative integers each no more than 6.at n=8A001978
- Number of partitions of 4n-1 into n nonnegative integers each no greater than 8.at n=6A001982
- Number of symmetric filaments (strip polyominoes) with n square cells.at n=13A002014