Nerdulator> put something in

Recognised as Number

16,349

  • Positive
  • Odd
  • Prime
  • 5 digits

16,349 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 value16,349
Digit count5
Digit sum23
Digit product648
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation16,349
Distinct prime factors116,349
Number of divisors2
Sum of divisors σ(n)16,350
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)16,348integers below n that share no factor with it
Carmichael function λ(n)16,348the 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,3492 in total

Arithmetic

Previous number16,348
Next number16,350
Double32,698
Square root127.863208156≈irrational, shown to 9 decimal places
Cube root25.380318314≈
Negation-16,349
Reciprocal0.0000611658≈

Representations

Decimal16,349
Binary1111111101110114 bits
Octal37735
Hexadecimal3FDD
Base 36CM5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixteen thousand, three hundred and forty-nine
Ordinalsixteen thousand, three hundred and forty-ninth
Scientific notation1.6349 × 10^4
Engineering notation16.349 × 10^3

In other bases

Ternary211102112base 3; the most digit-efficient integer base after e: 9 digits
Quinary1010344base 5; one hand: 7 digits
Septenary65444base 7: 5 digits
Nonary24375base 9; each digit is two ternary digits: 5 digits
Duodecimal9565base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal20h9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:32:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T11110TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000000101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0011111111011101
Bit length14 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits2within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes23f dd
Gray code10000000110011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0011111111011101
32-bit00000000000000000011111111011101
64-bit0000000000000000000000000000000000000000000000000011111111011101
One's complement1100000000100010at 16 bits, every bit flipped
Bits reversed1011101111111100at 16 bits
Rotated left by 10111111110111010at 16 bits, wrapping
Shifted left by 1111111110111010= 32,698, no wrap
Shifted right by 11111111101110= 8,174, discarding the low bit
These bits as a double8.07747924 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime16,361+12
Previous prime16,339−10
Distance to nearest prime0, it is prime
Nearest square below16,129
Nearest square above16,384

Powers & multiples

16,349 to the power 2267,289,801
16,349 to the power 34,369,920,956,549
16,349 to the power 471,443,837,718,619,601
16,349 to the power 51,168,035,302,861,711,856,749
First ten multiples16,349, 32,698, 49,047, 65,396, 81,745, 98,094, 114,443, 130,792, 147,141, 163,490
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1159the total stopping time
Highest value reached49,0483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps16,349 → 49,048 → 24,524 → 12,262 → 6,131 → 18,394 → 9,197 → 27,592 → 13,796 → 6,898 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,634,900%
16,349% as a decimal163.49
16,349% of 10016,349
16,349% of 1,000163,490
As a fraction of 10016,349/100

Read another way

As bytes15.966 KiB
As a 24-bit colour#003FDD

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