Recognised as Number

19,061

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value19,061

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation7^2 × 389

Distinct prime factors27, 389

Number of divisors6

Sum of divisors σ(n)22,230

Aliquot sum3,169sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)8,148the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 16,296

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 7, 49, 389, 2,723, 19,0616 in total

Arithmetic

Previous number19,060

Next number19,062

Double38,122

Half9,530.5

Square363,321,721

Cube6,925,275,323,981

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

Cube root26.71254256≈

Negation-19,061

Reciprocal0.0000524631≈

Representations

Decimal19,061

Binary10010100111010115 bits

Octal45165

Hexadecimal4A75

Base 36EPH

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

In wordsnineteen thousand and sixty-one

Ordinalnineteen thousand and sixty-first

Scientific notation1.9061 × 10^4

Engineering notation19.061 × 10^3

In other bases

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

Quinary1102221base 5; one hand: 7 digits

Septenary106400base 7: 6 digits

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

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

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

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

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

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

Bit-level

0100101001110101

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 75

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

At each machine width

16-bit0100101001110101

32-bit00000000000000000100101001110101

64-bit0000000000000000000000000000000000000000000000000100101001110101

One's complement1011010110001010at 16 bits, every bit flipped

Bits reversed1010111001010010at 16 bits

Rotated left by 11001010011101010at 16 bits, wrapping

Shifted left by 11001010011101010= 38,122, no wrap

Shifted right by 110010100111010= 9,530, discarding the low bit

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

Nearest landmarks

Next prime19,069+8

Previous prime19,051−10

Distance to nearest prime8

Nearest square below19,044

Nearest square above19,321

Powers & multiples

19,061 to the power 2363,321,721

19,061 to the power 36,925,275,323,981

19,061 to the power 4132,002,672,950,401,841

19,061 to the power 52,516,102,949,107,609,491,301

First ten multiples19,061, 38,122, 57,183, 76,244, 95,305, 114,366, 133,427, 152,488, 171,549, 190,610

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 1

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 1

Divisible by 11No, remainder 9

Divisible by 12No, remainder 5

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 153the total stopping time

Highest value reached57,1843× the starting value

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

First steps19,061 → 57,184 → 28,592 → 14,296 → 7,148 → 3,574 → 1,787 → 5,362 → 2,681 → 8,044 → …

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

As a percentage & fraction

As a percentage1,906,100%

19,061% as a decimal190.61

19,061% of 10019,061

19,061% of 1,000190,610

As a fraction of 10019,061/100

Read another way

As seconds5 hours, 17 minutes and 41 seconds

As bytes18.614 KiB

As a 24-bit colour#004A75

Keep nerding

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