46
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 72
- Proper Divisor Sum (Aliquot Sum)
- 26
- 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
- 22
- Möbius Function
- 1
- Radical
- 46
- 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
- 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
- 16
- Smith Number
- no
Classification
- Natural
- yes
- Even
- yes
- Odd
- no
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
- sechsundvierzig· ordinal: sechsundvierzigste
- English
- forty-six· ordinal: forty-sixth
- Spanish
- cuarenta y seis· ordinal: 46º
- French
- quarante-six· ordinal: quarante-sixième
- Italian
- quarantasei· ordinal: 46º
- Latin
- quadraginta sex· ordinal: 46.
- Portuguese
- quarenta e seis· ordinal: 46º
Appears in sequences
- Expansion of Product_{m >= 1} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts.at n=18A000009
- Euler totient function phi(n): count numbers <= n and prime to n.at n=46A000010
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=45A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=45A000027
- Number of necklaces with n beads of 2 colors, allowing turning over (these are also called bracelets).at n=9A000029
- Numbers that are not squares (or, the nonsquares).at n=39A000037
- 1-digit numbers arranged in alphabetical order, then the 2-digit numbers arranged in alphabetical order, then the 3-digit numbers, etc.at n=40A000052
- Generalized tangent numbers d(n,1).at n=21A000061
- Numbers k such that k^4 + 1 is prime.at n=9A000068
- a(n) = floor(n^(3/2)).at n=13A000093
- Number of binary partitions: number of partitions of 2n into powers of 2.at n=9A000123
- Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts.at n=9A000124
- Positive zeros of Bessel function of order 0 rounded to nearest integer.at n=14A000134
- Generalized tangent numbers d_(n,2).at n=2A000176
- Generalized tangent numbers d(3, n).at n=1A000191
- Generalized Euler numbers c(6,n).at n=1A000192
- Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.at n=28A000201
- A Beatty sequence: floor(n*(e-1)).at n=26A000210
- Number of inequivalent Boolean functions of n variables under action of complementing group.at n=3A000231
- Generalized class numbers c_(n,1).at n=5A000233