Recognised as Number

64,131

Positive
Odd
Composite
5 digits

64,131 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value64,131

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 × 21,377

Distinct prime factors23, 21,377

Number of divisors4

Sum of divisors σ(n)85,512

Aliquot sum21,381sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 21,377, 64,1314 in total

Arithmetic

Previous number64,130

Next number64,132

Double128,262

Half32,065.5

Square4,112,785,161

Cube263,757,025,160,091

Square root253.240991942≈irrational, shown to 9 decimal places

Cube root40.027273067≈

Negation-64,131

Reciprocal0.0000155931≈

Representations

Decimal64,131

Binary111110101000001116 bits

Octal175203

HexadecimalFA83

Base 361DHF

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

In wordssixty-four thousand, one hundred and thirty-one

Ordinalsixty-four thousand, one hundred and thirty-first

Scientific notation6.4131 × 10^4

Engineering notation64.131 × 10^3

In other bases

Ternary10020222020base 3; the most digit-efficient integer base after e: 11 digits

Quinary4023011base 5; one hand: 7 digits

Septenary354654base 7: 6 digits

Nonary106866base 9; each digit is two ternary digits: 6 digits

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

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

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

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

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

Bit-level

1111101010000011

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

Bytes2fa 83

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

At each machine width

16-bit1111101010000011

32-bit00000000000000001111101010000011

64-bit0000000000000000000000000000000000000000000000001111101010000011

One's complement0000010101111100at 16 bits, every bit flipped

Bits reversed1100000101011111at 16 bits

Rotated left by 11111010100000111at 16 bits, wrapping

Shifted left by 111111010100000110= 128,262, no wrap

Shifted right by 1111110101000001= 32,065, discarding the low bit

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

Nearest landmarks

Next prime64,151+20

Previous prime64,123−8

Distance to nearest prime8

Nearest square below64,009

Nearest square above64,516

Powers & multiples

64,131 to the power 24,112,785,161

64,131 to the power 3263,757,025,160,091

64,131 to the power 416,915,001,780,541,795,921

64,131 to the power 51,084,775,979,187,925,914,209,651

First ten multiples64,131, 128,262, 192,393, 256,524, 320,655, 384,786, 448,917, 513,048, 577,179, 641,310

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 4

Divisible by 8No, remainder 3

Divisible by 9No, remainder 6

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 3

Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 1148the total stopping time

Highest value reached288,5924× the starting value

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

First steps64,131 → 192,394 → 96,197 → 288,592 → 144,296 → 72,148 → 36,074 → 18,037 → 54,112 → 27,056 → …

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

As a percentage & fraction

As a percentage6,413,100%

64,131% as a decimal641.31

64,131% of 10064,131

64,131% of 1,000641,310

As a fraction of 10064,131/100

Read another way

As seconds17 hours, 48 minutes and 51 seconds

As bytes62.628 KiB

As a 24-bit colour#00FA83

Keep nerding

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