Recognised as Number

19,059

Positive
Odd
Composite
5 digits

19,059 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value19,059

Digit count5

Digit sum24

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 6,353

Distinct prime factors23, 6,353

Number of divisors4

Sum of divisors σ(n)25,416

Aliquot sum6,357sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)6,352the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 12,704

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 6,353, 19,0594 in total

Arithmetic

Previous number19,058

Next number19,060

Double38,118

Half9,529.5

Square363,245,481

Cube6,923,095,622,379

Square root138.054337129≈irrational, shown to 9 decimal places

Cube root26.711608245≈

Negation-19,059

Reciprocal0.0000524686≈

Representations

Decimal19,059

Binary10010100111001115 bits

Octal45163

Hexadecimal4A73

Base 36EPF

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

In wordsnineteen thousand and fifty-nine

Ordinalnineteen thousand and fifty-ninth

Scientific notation1.9059 × 10^4

Engineering notation19.059 × 10^3

In other bases

Ternary222010220base 3; the most digit-efficient integer base after e: 9 digits

Quinary1102214base 5; one hand: 7 digits

Septenary106365base 7: 6 digits

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

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

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

Sexagesimal5:17:39base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0100101001110011

Bit length15 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits7within that length

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

Bytes24a 73

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

At each machine width

16-bit0100101001110011

32-bit00000000000000000100101001110011

64-bit0000000000000000000000000000000000000000000000000100101001110011

One's complement1011010110001100at 16 bits, every bit flipped

Bits reversed1100111001010010at 16 bits

Rotated left by 11001010011100110at 16 bits, wrapping

Shifted left by 11001010011100110= 38,118, no wrap

Shifted right by 110010100111001= 9,529, discarding the low bit

These bits as a double9.41639714 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime19,069+10

Previous prime19,051−8

Distance to nearest prime8

Nearest square below19,044

Nearest square above19,321

Powers & multiples

19,059 to the power 2363,245,481

19,059 to the power 36,923,095,622,379

19,059 to the power 4131,947,279,466,921,361

19,059 to the power 52,514,783,199,360,054,219,299

First ten multiples19,059, 38,118, 57,177, 76,236, 95,295, 114,354, 133,413, 152,472, 171,531, 190,590

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 3

Divisible by 9No, remainder 6

Divisible by 10No, remainder 9

Divisible by 11No, remainder 7

Divisible by 12No, remainder 3

Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 1105the total stopping time

Highest value reached85,7684× the starting value

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

First steps19,059 → 57,178 → 28,589 → 85,768 → 42,884 → 21,442 → 10,721 → 32,164 → 16,082 → 8,041 → …

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

As a percentage & fraction

As a percentage1,905,900%

19,059% as a decimal190.59

19,059% of 10019,059

19,059% of 1,000190,590

As a fraction of 10019,059/100

Read another way

As seconds5 hours, 17 minutes and 39 seconds

As bytes18.612 KiB

As a 24-bit colour#004A73

Keep nerding

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