Recognised as Number

46,113

Positive
Odd
Composite
5 digits

46,113 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value46,113

Digit count5

Digit sum15

Digit product72

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 19 × 809

Distinct prime factors33, 19, 809

Number of divisors8

Sum of divisors σ(n)64,800

Aliquot sum18,687sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 19, 57, 809, 2,427, 15,371, 46,1138 in total

Arithmetic

Previous number46,112

Next number46,114

Double92,226

Half23,056.5

Square2,126,408,769

Cube98,055,087,564,897

Square root214.73937692≈irrational, shown to 9 decimal places

Cube root35.859794169≈

Negation-46,113

Reciprocal0.0000216859≈

Representations

Decimal46,113

Binary101101000010000116 bits

Octal132041

HexadecimalB421

Base 36ZKX

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

In wordsforty-six thousand, one hundred and thirteen

Ordinalforty-six thousand, one hundred and thirteenth

Scientific notation4.6113 × 10^4

Engineering notation46.113 × 10^3

In other bases

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

Quinary2433423base 5; one hand: 7 digits

Septenary251304base 7: 6 digits

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

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

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

Sexagesimal12:48:33base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1011010000100001

Bit length16 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits10within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2b4 21

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

At each machine width

16-bit1011010000100001

32-bit00000000000000001011010000100001

64-bit0000000000000000000000000000000000000000000000001011010000100001

One's complement0100101111011110at 16 bits, every bit flipped

Bits reversed1000010000101101at 16 bits

Rotated left by 10110100001000011at 16 bits, wrapping

Shifted left by 110110100001000010= 92,226, no wrap

Shifted right by 1101101000010000= 23,056, discarding the low bit

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

Nearest landmarks

Next prime46,133+20

Previous prime46,103−10

Distance to nearest prime10

Nearest square below45,796

Nearest square above46,225

Powers & multiples

46,113 to the power 22,126,408,769

46,113 to the power 398,055,087,564,897

46,113 to the power 44,521,614,252,880,095,361

46,113 to the power 5208,505,198,043,059,837,381,793

First ten multiples46,113, 92,226, 138,339, 184,452, 230,565, 276,678, 322,791, 368,904, 415,017, 461,130

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 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 6

Divisible by 10No, remainder 3

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1101the total stopping time

Highest value reached747,95216× the starting value

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

First steps46,113 → 138,340 → 69,170 → 34,585 → 103,756 → 51,878 → 25,939 → 77,818 → 38,909 → 116,728 → …

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

As a percentage & fraction

As a percentage4,611,300%

46,113% as a decimal461.13

46,113% of 10046,113

46,113% of 1,000461,130

As a fraction of 10046,113/100

Read another way

As seconds12 hours, 48 minutes and 33 seconds

As bytes45.032 KiB

As a 24-bit colour#00B421

Keep nerding

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