Recognised as Number

43,331

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value43,331

Digit count5

Digit sum14

Digit product108

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation43,331

Distinct prime factors143,331

Number of divisors2

Sum of divisors σ(n)43,332

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)43,330the 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, 43,3312 in total

Arithmetic

Previous number43,330

Next number43,332

Double86,662

Half21,665.5

Square1,877,575,561

Cube81,357,226,633,691

Square root208.160995386≈irrational, shown to 9 decimal places

Cube root35.123644321≈

Negation-43,331

Reciprocal0.0000230782≈

Representations

Decimal43,331

Binary101010010100001116 bits

Octal124503

HexadecimalA943

Base 36XFN

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

In wordsforty-three thousand, three hundred and thirty-one

Ordinalforty-three thousand, three hundred and thirty-first

Scientific notation4.3331 × 10^4

Engineering notation43.331 × 10^3

In other bases

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

Quinary2341311base 5; one hand: 7 digits

Septenary240221base 7: 6 digits

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

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

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

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

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

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

Bit-level

1010100101000011

Bit length16 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits9within that length

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

Bytes2a9 43

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

At each machine width

16-bit1010100101000011

32-bit00000000000000001010100101000011

64-bit0000000000000000000000000000000000000000000000001010100101000011

One's complement0101011010111100at 16 bits, every bit flipped

Bits reversed1100001010010101at 16 bits

Rotated left by 10101001010000111at 16 bits, wrapping

Shifted left by 110101001010000110= 86,662, no wrap

Shifted right by 1101010010100001= 21,665, discarding the low bit

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

Nearest landmarks

Next prime43,391+60

Previous prime43,321−10

Distance to nearest prime0, it is prime

Nearest square below43,264

Nearest square above43,681

Powers & multiples

43,331 to the power 21,877,575,561

43,331 to the power 381,357,226,633,691

43,331 to the power 43,525,289,987,264,464,721

43,331 to the power 5152,754,340,438,156,520,825,651

First ten multiples43,331, 86,662, 129,993, 173,324, 216,655, 259,986, 303,317, 346,648, 389,979, 433,310

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 5

Divisible by 10No, remainder 1

Divisible by 11No, remainder 2

Divisible by 12No, remainder 11

Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 1101the total stopping time

Highest value reached194,9924× the starting value

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

First steps43,331 → 129,994 → 64,997 → 194,992 → 97,496 → 48,748 → 24,374 → 12,187 → 36,562 → 18,281 → …

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

As a percentage & fraction

As a percentage4,333,100%

43,331% as a decimal433.31

43,331% of 10043,331

43,331% of 1,000433,310

As a fraction of 10043,331/100

Read another way

As seconds12 hours, 2 minutes and 11 seconds

As bytes42.315 KiB

As a 24-bit colour#00A943

Keep nerding

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