Nerdulator> put something in

Recognised as Number

19,081

  • Positive
  • Odd
  • Prime
  • 5 digits

19,081 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value19,081
Digit count5
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation19,081
Distinct prime factors119,081
Number of divisors2
Sum of divisors σ(n)19,082
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)19,080integers below n that share no factor with it
Carmichael function λ(n)19,080the 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, 19,0812 in total

Arithmetic

Previous number19,080
Next number19,082
Double38,162
Square root138.13399292≈irrational, shown to 9 decimal places
Cube root26.721882121≈
Negation-19,081
Reciprocal0.0000524082≈

Representations

Decimal19,081
Binary10010101000100115 bits
Octal45211
Hexadecimal4A89
Base 36EQ1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnineteen thousand and eighty-one
Ordinalnineteen thousand and eighty-first
Scientific notation1.9081 × 10^4
Engineering notation19.081 × 10^3

In other bases

Ternary222011201base 3; the most digit-efficient integer base after e: 9 digits
Quinary1102311base 5; one hand: 7 digits
Septenary106426base 7: 6 digits
Nonary28151base 9; each digit is two ternary digits: 5 digits
Duodecimalb061base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal27e1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal5:18:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary100T1TTT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101111110011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0100101010001001
Bit length15 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits9within that length
Bit parityeven6 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 89
Gray code110111111001101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100101010001001
32-bit00000000000000000100101010001001
64-bit0000000000000000000000000000000000000000000000000100101010001001
One's complement1011010101110110at 16 bits, every bit flipped
Bits reversed1001000101010010at 16 bits
Rotated left by 11001010100010010at 16 bits, wrapping
Shifted left by 11001010100010010= 38,162, no wrap
Shifted right by 110010101000100= 9,540, discarding the low bit
These bits as a double9.42726659 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime19,087+6
Previous prime19,079−2
Distance to nearest prime0, it is prime
Nearest square below19,044
Nearest square above19,321

Powers & multiples

19,081 to the power 2364,084,561
19,081 to the power 36,947,097,508,441
19,081 to the power 4132,557,567,558,562,721
19,081 to the power 52,529,330,946,584,935,279,401
First ten multiples19,081, 38,162, 57,243, 76,324, 95,405, 114,486, 133,567, 152,648, 171,729, 190,810
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 153the total stopping time
Highest value reached163,0248× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps19,081 → 57,244 → 28,622 → 14,311 → 42,934 → 21,467 → 64,402 → 32,201 → 96,604 → 48,302 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,908,100%
19,081% as a decimal190.81
19,081% of 10019,081
19,081% of 1,000190,810
As a fraction of 10019,081/100

Read another way

As bytes18.634 KiB
As a 24-bit colour#004A89

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