Nerdulator> put something in

Recognised as Number

19,079

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value19,079
Digit count5
Digit sum26
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 factorisation19,079
Distinct prime factors119,079
Number of divisors2
Sum of divisors σ(n)19,080
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)19,078integers below n that share no factor with it
Carmichael function λ(n)19,078the 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,0792 in total

Arithmetic

Previous number19,078
Next number19,080
Double38,158
Square root138.126753383≈irrational, shown to 9 decimal places
Cube root26.720948459≈
Negation-19,079
Reciprocal0.0000524136≈

Representations

Decimal19,079
Binary10010101000011115 bits
Octal45207
Hexadecimal4A87
Base 36EPZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnineteen thousand and seventy-nine
Ordinalnineteen thousand and seventy-ninth
Scientific notation1.9079 × 10^4
Engineering notation19.079 × 10^3

In other bases

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

Bit-level

0100101010000111
Bit length15 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits8within that length
Bit parityodd7 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
Bytes24a 87
Gray code110111111000100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100101010000111
32-bit00000000000000000100101010000111
64-bit0000000000000000000000000000000000000000000000000100101010000111
One's complement1011010101111000at 16 bits, every bit flipped
Bits reversed1110000101010010at 16 bits
Rotated left by 11001010100001110at 16 bits, wrapping
Shifted left by 11001010100001110= 38,158, no wrap
Shifted right by 110010101000011= 9,539, discarding the low bit
These bits as a double9.42627846 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

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

Powers & multiples

19,079 to the power 2364,008,241
19,079 to the power 36,944,913,230,039
19,079 to the power 4132,501,999,515,914,081
19,079 to the power 52,528,005,648,764,124,751,399
First ten multiples19,079, 38,158, 57,237, 76,316, 95,395, 114,474, 133,553, 152,632, 171,711, 190,790
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 79

Collatz (3n + 1) trajectory

Steps to reach 179the total stopping time
Highest value reached128,7886× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps19,079 → 57,238 → 28,619 → 85,858 → 42,929 → 128,788 → 64,394 → 32,197 → 96,592 → 48,296 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,907,900%
19,079% as a decimal190.79
19,079% of 10019,079
19,079% of 1,000190,790
As a fraction of 10019,079/100

Read another way

As bytes18.632 KiB
As a 24-bit colour#004A87

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