35
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 48
- Proper Divisor Sum (Aliquot Sum)
- 13
- 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
- 24
- Möbius Function
- 1
- Radical
- 35
- Omega Function (Ω)
- 2
- 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
- yes
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- yes
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 13
- Smith Number
- no
Classification
- Natural
- yes
- Even
- no
- Odd
- yes
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
Names
- German
- fünfunddreißig· ordinal: fünfunddreißigste
- English
- thirty-five· ordinal: thirty-fifth
- Spanish
- treinta y cinco· ordinal: 35º
- French
- trente-cinq· ordinal: trente-cinqième
- Italian
- trentacinque· ordinal: 35º
- Latin
- triginta quinque· ordinal: 35.
- Portuguese
- trinta e cinco· ordinal: 35º
Appears in sequences
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=34A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=34A000027
- Numbers that are not squares (or, the nonsquares).at n=29A000037
- Odious numbers: numbers with an odd number of 1's in their binary expansion.at n=17A000069
- a(n) = n*(n+3)/2.at n=7A000096
- Number of n-celled free polyominoes without holes.at n=6A000104
- Number of free polyominoes (or square animals) with n cells.at n=6A000105
- Number of rooted trees with n nodes and a single labeled node; pointed rooted trees; vertebrates.at n=5A000107
- Erroneous version of A003713.at n=4A000154
- Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.at n=21A000201
- a(8i+j) = 13i + a(j), where 1<=j<=8.at n=21A000202
- Remove all factors of 2 from n; or largest odd divisor of n; or odd part of n.at n=34A000265
- Remove all factors of 2 from n; or largest odd divisor of n; or odd part of n.at n=69A000265
- Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n*(n+1)*(n+2)/6.at n=5A000292
- Pentagonal numbers: a(n) = n*(3*n-1)/2.at n=5A000326
- Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24.at n=7A000332
- Number of rooted cubic maps with 2n nodes and a distinguished Hamiltonian cycle: (2n)!(2n+1)! / (n!^2*(n+1)!(n+2)!).at n=2A000356
- Number of 5-level labeled rooted trees with n leaves.at n=3A000357
- Sums of three squares: numbers of the form x^2 + y^2 + z^2.at n=30A000378
- Numbers where total number of 1-bits in the exponents of their prime factorization is even; a 2-way classification of integers: complement of A000028.at n=17A000379