Nerdulator> put something in

Recognised as Number

16,433

  • Positive
  • Odd
  • Prime
  • 5 digits

16,433 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 value16,433
Digit count5
Digit sum17
Digit product216
Multiplicative persistence3times 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 factorisation16,433
Distinct prime factors116,433
Number of divisors2
Sum of divisors σ(n)16,434
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)16,432integers below n that share no factor with it
Carmichael function λ(n)16,432the 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, 16,4332 in total

Arithmetic

Previous number16,432
Next number16,434
Double32,866
Square root128.191263353≈irrational, shown to 9 decimal places
Cube root25.423711505≈
Negation-16,433
Reciprocal0.0000608532≈

Representations

Decimal16,433
Binary10000000011000115 bits
Octal40061
Hexadecimal4031
Base 36COH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixteen thousand, four hundred and thirty-three
Ordinalsixteen thousand, four hundred and thirty-third
Scientific notation1.6433 × 10^4
Engineering notation16.433 × 10^3

In other bases

Ternary211112122base 3; the most digit-efficient integer base after e: 9 digits
Quinary1011213base 5; one hand: 7 digits
Septenary65624base 7: 5 digits
Nonary24478base 9; each digit is two ternary digits: 5 digits
Duodecimal9615base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal211dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:33:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10TTTT0T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0100000000110001
Bit length15 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits11within that length
Bit parityeven4 set bits, so even; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes240 31
Gray code110000000101001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100000000110001
32-bit00000000000000000100000000110001
64-bit0000000000000000000000000000000000000000000000000100000000110001
One's complement1011111111001110at 16 bits, every bit flipped
Bits reversed1000110000000010at 16 bits
Rotated left by 11000000001100010at 16 bits, wrapping
Shifted left by 11000000001100010= 32,866, no wrap
Shifted right by 110000000011000= 8,216, discarding the low bit
These bits as a double8.11898076 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime16,447+14
Previous prime16,427−6
Distance to nearest prime0, it is prime
Nearest square below16,384
Nearest square above16,641

Powers & multiples

16,433 to the power 2270,043,489
16,433 to the power 34,437,624,654,737
16,433 to the power 472,923,485,951,293,121
16,433 to the power 51,198,351,644,637,599,857,393
First ten multiples16,433, 32,866, 49,299, 65,732, 82,165, 98,598, 115,031, 131,464, 147,897, 164,330
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1159the total stopping time
Highest value reached49,3003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps16,433 → 49,300 → 24,650 → 12,325 → 36,976 → 18,488 → 9,244 → 4,622 → 2,311 → 6,934 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,643,300%
16,433% as a decimal164.33
16,433% of 10016,433
16,433% of 1,000164,330
As a fraction of 10016,433/100

Read another way

As bytes16.048 KiB
As a 24-bit colour#004031

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 “16433” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.