Nerdulator> put something in

Recognised as Number

43,487

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value43,487
Digit count5
Digit sum26
Digit product2,688
Multiplicative persistence6times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation43,487
Distinct prime factors143,487
Number of divisors2
Sum of divisors σ(n)43,488
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)43,486integers below n that share no factor with it
Carmichael function λ(n)43,486the 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,4872 in total

Arithmetic

Previous number43,486
Next number43,488
Double86,974
Square root208.535368703≈irrational, shown to 9 decimal places
Cube root35.165744481≈
Negation-43,487
Reciprocal0.0000229954≈

Representations

Decimal43,487
Binary101010011101111116 bits
Octal124737
HexadecimalA9DF
Base 36XJZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-three thousand, four hundred and eighty-seven
Ordinalforty-three thousand, four hundred and eighty-seventh
Scientific notation4.3487 × 10^4
Engineering notation43.487 × 10^3

In other bases

Ternary2012122122base 3; the most digit-efficient integer base after e: 10 digits
Quinary2342422base 5; one hand: 7 digits
Septenary240533base 7: 6 digits
Nonary65578base 9; each digit is two ternary digits: 5 digits
Duodecimal211bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal58e7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal12:4:47base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T1T0T00T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111111000100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1010100111011111
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
Bytes2a9 df
Gray code1111110100110000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010100111011111
32-bit00000000000000001010100111011111
64-bit0000000000000000000000000000000000000000000000001010100111011111
One's complement0101011000100000at 16 bits, every bit flipped
Bits reversed1111101110010101at 16 bits
Rotated left by 10101001110111111at 16 bits, wrapping
Shifted left by 110101001110111110= 86,974, no wrap
Shifted right by 1101010011101111= 21,743, discarding the low bit
These bits as a double2.14854327 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime43,499+12
Previous prime43,481−6
Distance to nearest prime0, it is prime
Nearest square below43,264
Nearest square above43,681

Powers & multiples

43,487 to the power 21,891,119,169
43,487 to the power 382,239,099,302,303
43,487 to the power 43,576,331,711,359,250,561
43,487 to the power 5155,523,937,131,879,729,146,207
First ten multiples43,487, 86,974, 130,461, 173,948, 217,435, 260,922, 304,409, 347,896, 391,383, 434,870
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 87

Collatz (3n + 1) trajectory

Steps to reach 1181the total stopping time
Highest value reached27,114,424623× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps43,487 → 130,462 → 65,231 → 195,694 → 97,847 → 293,542 → 146,771 → 440,314 → 220,157 → 660,472 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,348,700%
43,487% as a decimal434.87
43,487% of 10043,487
43,487% of 1,000434,870
As a fraction of 10043,487/100

Read another way

As bytes42.468 KiB
As a 24-bit colour#00A9DF

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “43487” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.