Recognised as Number

46,962

Positive
Even
Composite
5 digits

46,962 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value46,962

Digit count5

Digit sum27

Digit product2,592

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3^2 × 2,609

Distinct prime factors32, 3, 2,609

Number of divisors12

Sum of divisors σ(n)101,790

Aliquot sum54,828sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)15,648integers below n that share no factor with it

Carmichael function λ(n)7,824the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 15,648

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 6, 9, 18, 2,609, 5,218, 7,827, 15,654, 23,481, 46,96212 in total

Arithmetic

Previous number46,961

Next number46,963

Double93,924

Half23,481

Square2,205,429,444

Cube103,571,377,549,128

Square root216.7071757≈irrational, shown to 9 decimal places

Cube root36.078532265≈

Negation-46,962

Reciprocal0.0000212938≈

Representations

Decimal46,962

Binary101101110111001016 bits

Octal133562

HexadecimalB772

Base 36108I

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsforty-six thousand, nine hundred and sixty-two

Ordinalforty-six thousand, nine hundred and sixty-second

Scientific notation4.6962 × 10^4

Engineering notation46.962 × 10^3

In other bases

Ternary2101102100base 3; the most digit-efficient integer base after e: 10 digits

Quinary3000322base 5; one hand: 7 digits

Septenary253626base 7: 6 digits

Nonary71370base 9; each digit is two ternary digits: 5 digits

Duodecimal23216base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal5h82base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal13:2:42base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1T10111T100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11100100010110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1011011101110010

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

Bit parityeven10 set bits, so even; not the same as the number itself being even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2b7 72

Gray code1110110011001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1011011101110010

32-bit00000000000000001011011101110010

64-bit0000000000000000000000000000000000000000000000001011011101110010

One's complement0100100010001101at 16 bits, every bit flipped

Bits reversed0100111011101101at 16 bits

Rotated left by 10110111011100101at 16 bits, wrapping

Shifted left by 110110111011100100= 93,924, no wrap

Shifted right by 1101101110111001= 23,481, discarding the low bit

These bits as a double2.32023109 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime46,993+31

Previous prime46,957−5

Distance to nearest prime5

Nearest square below46,656

Nearest square above47,089

Powers & multiples

46,962 to the power 22,205,429,444

46,962 to the power 3103,571,377,549,128

46,962 to the power 44,863,919,032,462,149,136

46,962 to the power 5228,419,365,602,487,447,724,832

First ten multiples46,962, 93,924, 140,886, 187,848, 234,810, 281,772, 328,734, 375,696, 422,658, 469,620

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 6

Divisible by 8No, remainder 2

Divisible by 9Yes

Divisible by 10No, remainder 2

Divisible by 11No, remainder 3

Divisible by 12No, remainder 6

Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 152the total stopping time

Highest value reached79,2521× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps46,962 → 23,481 → 70,444 → 35,222 → 17,611 → 52,834 → 26,417 → 79,252 → 39,626 → 19,813 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,696,200%

46,962% as a decimal469.62

46,962% of 10046,962

46,962% of 1,000469,620

As a fraction of 10046,962/100

Read another way

As seconds13 hours, 2 minutes and 42 seconds

As bytes45.861 KiB

As a 24-bit colour#00B772

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.