Recognised as Number

19,064

Positive
Even
Composite
5 digits

19,064 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value19,064

Digit count5

Digit sum20

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 2,383

Distinct prime factors22, 2,383

Number of divisors8

Sum of divisors σ(n)35,760

Aliquot sum16,696sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,382the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 9,528

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 2,383, 4,766, 9,532, 19,0648 in total

Arithmetic

Previous number19,063

Next number19,065

Double38,128

Half9,532

Square363,436,096

Cube6,928,545,734,144

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

Cube root26.713943911≈

Negation-19,064

Reciprocal0.0000524549≈

Representations

Decimal19,064

Binary10010100111100015 bits

Octal45170

Hexadecimal4A78

Base 36EPK

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

In wordsnineteen thousand and sixty-four

Ordinalnineteen thousand and sixty-fourth

Scientific notation1.9064 × 10^4

Engineering notation19.064 × 10^3

In other bases

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

Quinary1102224base 5; one hand: 7 digits

Septenary106403base 7: 6 digits

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

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

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

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

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

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

Bit-level

0100101001111000

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 even

Highest set bitbit 14worth 16,384

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes24a 78

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

At each machine width

16-bit0100101001111000

32-bit00000000000000000100101001111000

64-bit0000000000000000000000000000000000000000000000000100101001111000

One's complement1011010110000111at 16 bits, every bit flipped

Bits reversed0001111001010010at 16 bits

Rotated left by 11001010011110000at 16 bits, wrapping

Shifted left by 11001010011110000= 38,128, no wrap

Shifted right by 110010100111100= 9,532, discarding the low bit

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

Nearest landmarks

Next prime19,069+5

Previous prime19,051−13

Distance to nearest prime5

Nearest square below19,044

Nearest square above19,321

Powers & multiples

19,064 to the power 2363,436,096

19,064 to the power 36,928,545,734,144

19,064 to the power 4132,085,795,875,721,216

19,064 to the power 52,518,083,612,574,749,261,824

First ten multiples19,064, 38,128, 57,192, 76,256, 95,320, 114,384, 133,448, 152,512, 171,576, 190,640

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8Yes

Divisible by 9No, remainder 2

Divisible by 10No, remainder 4

Divisible by 11No, remainder 1

Divisible by 12No, remainder 8

Divisible by 100No, remainder 64

Collatz (3n + 1) trajectory

Steps to reach 153the total stopping time

Highest value reached24,1361× the starting value

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

First steps19,064 → 9,532 → 4,766 → 2,383 → 7,150 → 3,575 → 10,726 → 5,363 → 16,090 → 8,045 → …

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

As a percentage & fraction

As a percentage1,906,400%

19,064% as a decimal190.64

19,064% of 10019,064

19,064% of 1,000190,640

As a fraction of 10019,064/100

Read another way

As seconds5 hours, 17 minutes and 44 seconds

As bytes18.617 KiB

As a 24-bit colour#004A78

Keep nerding

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