Recognised as Number

46,935

Positive
Odd
Composite
5 digits

46,935 is an odd 5-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value46,935

Digit count5

Digit sum27

Digit product3,240

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 5 × 7 × 149

Distinct prime factors43, 5, 7, 149

Number of divisors24

Sum of divisors σ(n)93,600

Aliquot sum46,665sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)444the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,312

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 7, 9, 15, 21, 35, 45, 63, 105, 149, 315, 447, 745, 1,043, 1,341, 2,235, 3,129, 5,215, 6,705, 9,387, 15,645, 46,93524 in total

Arithmetic

Previous number46,934

Next number46,936

Double93,870

Half23,467.5

Square2,202,894,225

Cube103,392,840,450,375

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

Cube root36.071616694≈

Negation-46,935

Reciprocal0.0000213061≈

Representations

Decimal46,935

Binary101101110101011116 bits

Octal133527

HexadecimalB757

Base 36107R

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

In wordsforty-six thousand, nine hundred and thirty-five

Ordinalforty-six thousand, nine hundred and thirty-fifth

Scientific notation4.6935 × 10^4

Engineering notation46.935 × 10^3

In other bases

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

Quinary3000220base 5; one hand: 7 digits

Septenary253560base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011011101010111

Bit length16 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits5within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2b7 57

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

At each machine width

16-bit1011011101010111

32-bit00000000000000001011011101010111

64-bit0000000000000000000000000000000000000000000000001011011101010111

One's complement0100100010101000at 16 bits, every bit flipped

Bits reversed1110101011101101at 16 bits

Rotated left by 10110111010101111at 16 bits, wrapping

Shifted left by 110110111010101110= 93,870, no wrap

Shifted right by 1101101110101011= 23,467, discarding the low bit

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

Nearest landmarks

Next prime46,957+22

Previous prime46,933−2

Distance to nearest prime2

Nearest square below46,656

Nearest square above47,089

Powers & multiples

46,935 to the power 22,202,894,225

46,935 to the power 3103,392,840,450,375

46,935 to the power 44,852,742,966,538,350,625

46,935 to the power 5227,763,491,134,477,486,584,375

First ten multiples46,935, 93,870, 140,805, 187,740, 234,675, 281,610, 328,545, 375,480, 422,415, 469,350

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9Yes

Divisible by 10No, remainder 5

Divisible by 11No, remainder 9

Divisible by 12No, remainder 3

Divisible by 100No, remainder 35

Collatz (3n + 1) trajectory

Steps to reach 1145the total stopping time

Highest value reached316,8166× the starting value

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

First steps46,935 → 140,806 → 70,403 → 211,210 → 105,605 → 316,816 → 158,408 → 79,204 → 39,602 → 19,801 → …

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

As a percentage & fraction

As a percentage4,693,500%

46,935% as a decimal469.35

46,935% of 10046,935

46,935% of 1,000469,350

As a fraction of 10046,935/100

Read another way

As seconds13 hours, 2 minutes and 15 seconds

As bytes45.835 KiB

As a 24-bit colour#00B757

Keep nerding

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