Recognised as Number

43,117

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value43,117

Digit count5

Digit sum16

Digit product84

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation43,117

Distinct prime factors143,117

Number of divisors2

Sum of divisors σ(n)43,118

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number43,116

Next number43,118

Double86,234

Half21,558.5

Square1,859,075,689

Cube80,157,766,482,613

Square root207.646333943≈irrational, shown to 9 decimal places

Cube root35.065726834≈

Negation-43,117

Reciprocal0.0000231927≈

Representations

Decimal43,117

Binary101010000110110116 bits

Octal124155

HexadecimalA86D

Base 36X9P

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

In wordsforty-three thousand, one hundred and seventeen

Ordinalforty-three thousand, one hundred and seventeenth

Scientific notation4.3117 × 10^4

Engineering notation43.117 × 10^3

In other bases

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

Quinary2334432base 5; one hand: 7 digits

Septenary236464base 7: 6 digits

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

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

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

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

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

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

Bit-level

1010100001101101

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

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

Bytes2a8 6d

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

At each machine width

16-bit1010100001101101

32-bit00000000000000001010100001101101

64-bit0000000000000000000000000000000000000000000000001010100001101101

One's complement0101011110010010at 16 bits, every bit flipped

Bits reversed1011011000010101at 16 bits

Rotated left by 10101000011011011at 16 bits, wrapping

Shifted left by 110101000011011010= 86,234, no wrap

Shifted right by 1101010000110110= 21,558, discarding the low bit

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

Nearest landmarks

Next prime43,133+16

Previous prime43,103−14

Distance to nearest prime0, it is prime

Nearest square below42,849

Nearest square above43,264

Powers & multiples

43,117 to the power 21,859,075,689

43,117 to the power 380,157,766,482,613

43,117 to the power 43,456,162,417,430,824,721

43,117 to the power 5149,019,354,952,364,869,495,357

First ten multiples43,117, 86,234, 129,351, 172,468, 215,585, 258,702, 301,819, 344,936, 388,053, 431,170

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 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 7

Divisible by 11No, remainder 8

Divisible by 12No, remainder 1

Divisible by 100No, remainder 17

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time

Highest value reached184,1924× the starting value

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

First steps43,117 → 129,352 → 64,676 → 32,338 → 16,169 → 48,508 → 24,254 → 12,127 → 36,382 → 18,191 → …

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

As a percentage & fraction

As a percentage4,311,700%

43,117% as a decimal431.17

43,117% of 10043,117

43,117% of 1,000431,170

As a fraction of 10043,117/100

Read another way

As seconds11 hours, 58 minutes and 37 seconds

As bytes42.106 KiB

As a 24-bit colour#00A86D

Keep nerding

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