Nerdulator> put something in

Recognised as Number

18,919

  • Positive
  • Odd
  • Prime
  • 5 digits

18,919 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 value18,919
Digit count5
Digit sum28
Digit product648
Multiplicative persistence4times 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 factorisation18,919
Distinct prime factors118,919
Number of divisors2
Sum of divisors σ(n)18,920
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)18,918integers below n that share no factor with it
Carmichael function λ(n)18,918the 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, 18,9192 in total

Arithmetic

Previous number18,918
Next number18,920
Double37,838
Square root137.546355822≈irrational, shown to 9 decimal places
Cube root26.646043082≈
Negation-18,919
Reciprocal0.0000528569≈

Representations

Decimal18,919
Binary10010011110011115 bits
Octal44747
Hexadecimal49E7
Base 36ELJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighteen thousand, nine hundred and nineteen
Ordinaleighteen thousand, nine hundred and nineteenth
Scientific notation1.8919 × 10^4
Engineering notation18.919 × 10^3

In other bases

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

Bit-level

0100100111100111
Bit length15 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits6within that length
Bit parityodd9 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
Bytes249 e7
Gray code110110100010100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100100111100111
32-bit00000000000000000100100111100111
64-bit0000000000000000000000000000000000000000000000000100100111100111
One's complement1011011000011000at 16 bits, every bit flipped
Bits reversed1110011110010010at 16 bits
Rotated left by 11001001111001110at 16 bits, wrapping
Shifted left by 11001001111001110= 37,838, no wrap
Shifted right by 110010011110011= 9,459, discarding the low bit
These bits as a double9.34722795 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime18,947+28
Previous prime18,917−2
Distance to nearest prime0, it is prime
Nearest square below18,769
Nearest square above19,044

Powers & multiples

18,919 to the power 2357,928,561
18,919 to the power 36,771,650,445,559
18,919 to the power 4128,112,854,779,530,721
18,919 to the power 52,423,767,099,573,941,710,599
First ten multiples18,919, 37,838, 56,757, 75,676, 94,595, 113,514, 132,433, 151,352, 170,271, 189,190
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 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 19

Collatz (3n + 1) trajectory

Steps to reach 1105the total stopping time
Highest value reached215,51211× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps18,919 → 56,758 → 28,379 → 85,138 → 42,569 → 127,708 → 63,854 → 31,927 → 95,782 → 47,891 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,891,900%
18,919% as a decimal189.19
18,919% of 10018,919
18,919% of 1,000189,190
As a fraction of 10018,919/100

Read another way

As bytes18.476 KiB
As a 24-bit colour#0049E7

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