Recognised as Number

46,251

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value46,251

Digit count5

Digit sum18

Digit product240

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^4 × 571

Distinct prime factors23, 571

Number of divisors10

Sum of divisors σ(n)69,212

Aliquot sum22,961sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)5,130the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 30,780

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 27, 81, 571, 1,713, 5,139, 15,417, 46,25110 in total

Arithmetic

Previous number46,250

Next number46,252

Double92,502

Half23,125.5

Square2,139,155,001

Cube98,938,057,951,251

Square root215.060456616≈irrational, shown to 9 decimal places

Cube root35.895530463≈

Negation-46,251

Reciprocal0.0000216212≈

Representations

Decimal46,251

Binary101101001010101116 bits

Octal132253

HexadecimalB4AB

Base 36ZOR

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

In wordsforty-six thousand, two hundred and fifty-one

Ordinalforty-six thousand, two hundred and fifty-first

Scientific notation4.6251 × 10^4

Engineering notation46.251 × 10^3

In other bases

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

Quinary2440001base 5; one hand: 7 digits

Septenary251562base 7: 6 digits

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

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

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

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

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

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

Bit-level

1011010010101011

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 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

Bytes2b4 ab

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

At each machine width

16-bit1011010010101011

32-bit00000000000000001011010010101011

64-bit0000000000000000000000000000000000000000000000001011010010101011

One's complement0100101101010100at 16 bits, every bit flipped

Bits reversed1101010100101101at 16 bits

Rotated left by 10110100101010111at 16 bits, wrapping

Shifted left by 110110100101010110= 92,502, no wrap

Shifted right by 1101101001010101= 23,125, discarding the low bit

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

Nearest landmarks

Next prime46,261+10

Previous prime46,237−14

Distance to nearest prime10

Nearest square below46,225

Nearest square above46,656

Powers & multiples

46,251 to the power 22,139,155,001

46,251 to the power 398,938,057,951,251

46,251 to the power 44,575,984,118,303,310,001

46,251 to the power 5211,643,841,455,646,390,856,251

First ten multiples46,251, 92,502, 138,753, 185,004, 231,255, 277,506, 323,757, 370,008, 416,259, 462,510

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 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 7

Divisible by 12No, remainder 3

Divisible by 100No, remainder 51

Collatz (3n + 1) trajectory

Steps to reach 1145the total stopping time

Highest value reached208,1324× the starting value

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

First steps46,251 → 138,754 → 69,377 → 208,132 → 104,066 → 52,033 → 156,100 → 78,050 → 39,025 → 117,076 → …

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

As a percentage & fraction

As a percentage4,625,100%

46,251% as a decimal462.51

46,251% of 10046,251

46,251% of 1,000462,510

As a fraction of 10046,251/100

Read another way

As seconds12 hours, 50 minutes and 51 seconds

As bytes45.167 KiB

As a 24-bit colour#00B4AB

Keep nerding

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