152
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 300
- Proper Divisor Sum (Aliquot Sum)
- 148
- 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
- 72
- Möbius Function
- 0
- Radical
- 38
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 23
- 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
- yes
- Odd
- no
Names
- German
- einshundertzweiundfünfzig· ordinal: einshundertzweiundfünfzigste
- English
- one hundred fifty-two· ordinal: one hundred fifty-second
- Spanish
- ciento cincuenta y dos· ordinal: 152º
- French
- cent cinquante-deux· ordinal: cent cinquante-deuxième
- Italian
- centocinquantadue· ordinal: 152º
- Latin
- centum quinquaginta duo· ordinal: 152.
- Portuguese
- cento e cinquenta e dois· ordinal: 152º
Appears in sequences
- Number of positive integers <= 2^n of form x^2 + 16*y^2.at n=10A000018
- a(n) = n*(n+3)/2.at n=16A000096
- Coefficients of ménage hit polynomials.at n=3A000159
- 3*n - 2*floor(sqrt(4*n+5)) + 5.at n=59A000277
- A Beatty sequence: [ n(e+1) ].at n=40A000572
- Salié numbers: expansion of cosh x / cos x = Sum_{n >= 0} a(n)*x^(2n)/(2n)!.at n=3A000795
- Number of collinear point-triples in an n X n grid.at n=4A000938
- Conjecturally largest even integer which is an unordered sum of two primes in exactly n ways.at n=4A000954
- Number of ways of writing 0 as Sum_{k=-n..n} e(k)*k, where e(k) is 0 or 1.at n=5A000980
- Numbers that are the sum of 2 successive primes.at n=20A001043
- Numbers m such that Sum_{k=0..m-1} exp(2*Pi*i*k^3/m) != 0.at n=42A001074
- Moran numbers: k such that k/(sum of digits of k) is prime.at n=11A001101
- a(n) = floor(n*log((14/11)*n^(10/9))).at n=35A001195
- a(n) = solution to the postage stamp problem with n denominations and 2 stamps.at n=19A001212
- Image of n under the map n->n/2 if n even, n->3n-1 if n odd.at n=51A001281
- Powers of 2 written in base 9.at n=7A001357
- Number of 5-line partitions of n.at n=8A001452
- Numbers whose digits contain no loops (version 2).at n=46A001742
- v-pile numbers of the 3-Wythoff game with i=1.at n=35A001958
- a(1) = 0, a(2) = 0; for n > 2, a(n) - a(n-3) - a(n-5) - ... - a(n-p) = n if n is prime, otherwise = 0, where p = largest prime < n.at n=18A002123