Nerdulator> put something in

Recognised as Number

16,435

  • Positive
  • Odd
  • Composite
  • 5 digits

16,435 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value16,435
Digit count5
Digit sum19
Digit product360
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 19 × 173
Distinct prime factors35, 19, 173
Number of divisors8
Sum of divisors σ(n)20,880
Aliquot sum4,445sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)12,384integers below n that share no factor with it
Carmichael function λ(n)1,548the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,384
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 19, 95, 173, 865, 3,287, 16,4358 in total

Arithmetic

Previous number16,434
Next number16,436
Double32,870
Square root128.199063959≈irrational, shown to 9 decimal places
Cube root25.424742872≈
Negation-16,435
Reciprocal0.0000608458≈

Representations

Decimal16,435
Binary10000000011001115 bits
Octal40063
Hexadecimal4033
Base 36COJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixteen thousand, four hundred and thirty-five
Ordinalsixteen thousand, four hundred and thirty-fifth
Scientific notation1.6435 × 10^4
Engineering notation16.435 × 10^3

In other bases

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

Bit-level

0100000000110011
Bit length15 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits10within that length
Bit parityodd5 set bits, so odd; 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 33
Gray code110000000101010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100000000110011
32-bit00000000000000000100000000110011
64-bit0000000000000000000000000000000000000000000000000100000000110011
One's complement1011111111001100at 16 bits, every bit flipped
Bits reversed1100110000000010at 16 bits
Rotated left by 11000000001100110at 16 bits, wrapping
Shifted left by 11000000001100110= 32,870, no wrap
Shifted right by 110000000011001= 8,217, discarding the low bit
These bits as a double8.11996889 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime16,447+12
Previous prime16,433−2
Distance to nearest prime2
Nearest square below16,384
Nearest square above16,641

Powers & multiples

16,435 to the power 2270,109,225
16,435 to the power 34,439,245,112,875
16,435 to the power 472,958,993,430,100,625
16,435 to the power 51,199,081,057,023,703,771,875
First ten multiples16,435, 32,870, 49,305, 65,740, 82,175, 98,610, 115,045, 131,480, 147,915, 164,350
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1159the total stopping time
Highest value reached73,9604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps16,435 → 49,306 → 24,653 → 73,960 → 36,980 → 18,490 → 9,245 → 27,736 → 13,868 → 6,934 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,643,500%
16,435% as a decimal164.35
16,435% of 10016,435
16,435% of 1,000164,350
As a fraction of 10016,435/100

Read another way

As bytes16.05 KiB
As a 24-bit colour#004033

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