Recognised as Number

56,263

Positive
Odd
Prime
5 digits

56,263 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value56,263

Digit count5

Digit sum22

Digit product1,080

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation56,263

Distinct prime factors156,263

Number of divisors2

Sum of divisors σ(n)56,264

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)56,262the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 56,2632 in total

Arithmetic

Previous number56,262

Next number56,264

Double112,526

Half28,131.5

Square3,165,525,169

Cube178,101,942,583,447

Square root237.198229336≈irrational, shown to 9 decimal places

Cube root38.318423103≈

Negation-56,263

Reciprocal0.0000177737≈

Representations

Decimal56,263

Binary110110111100011116 bits

Octal155707

HexadecimalDBC7

Base 3617EV

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

In wordsfifty-six thousand, two hundred and sixty-three

Ordinalfifty-six thousand, two hundred and sixty-third

Scientific notation5.6263 × 10^4

Engineering notation56.263 × 10^3

In other bases

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

Quinary3300023base 5; one hand: 7 digits

Septenary323014base 7: 6 digits

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

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

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

Sexagesimal15:37:43base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1101101111000111

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

Bytes2db c7

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

At each machine width

16-bit1101101111000111

32-bit00000000000000001101101111000111

64-bit0000000000000000000000000000000000000000000000001101101111000111

One's complement0010010000111000at 16 bits, every bit flipped

Bits reversed1110001111011011at 16 bits

Rotated left by 11011011110001111at 16 bits, wrapping

Shifted left by 111011011110001110= 112,526, no wrap

Shifted right by 1110110111100011= 28,131, discarding the low bit

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

Nearest landmarks

Next prime56,267+4

Previous prime56,249−14

Distance to nearest prime0, it is prime

Nearest square below56,169

Nearest square above56,644

Powers & multiples

56,263 to the power 23,165,525,169

56,263 to the power 3178,101,942,583,447

56,263 to the power 410,020,549,595,572,478,561

56,263 to the power 5563,786,181,895,694,361,277,543

First ten multiples56,263, 112,526, 168,789, 225,052, 281,315, 337,578, 393,841, 450,104, 506,367, 562,630

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 3

Divisible by 11No, remainder 9

Divisible by 12No, remainder 7

Divisible by 100No, remainder 63

Collatz (3n + 1) trajectory

Steps to reach 1184the total stopping time

Highest value reached3,079,78054× the starting value

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

First steps56,263 → 168,790 → 84,395 → 253,186 → 126,593 → 379,780 → 189,890 → 94,945 → 284,836 → 142,418 → …

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

As a percentage & fraction

As a percentage5,626,300%

56,263% as a decimal562.63

56,263% of 10056,263

56,263% of 1,000562,630

As a fraction of 10056,263/100

Read another way

As seconds15 hours, 37 minutes and 43 seconds

As bytes54.944 KiB

As a 24-bit colour#00DBC7

Keep nerding

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