Nerdulator> put something in

Recognised as Number

19,333

  • Positive
  • Odd
  • Prime
  • 5 digits

19,333 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,333
Digit count5
Digit sum19
Digit product243
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

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

Arithmetic

Previous number19,332
Next number19,334
Double38,666
Square root139.043158767≈irrational, shown to 9 decimal places
Cube root26.839005355≈
Negation-19,333
Reciprocal0.000051725≈

Representations

Decimal19,333
Binary10010111000010115 bits
Octal45605
Hexadecimal4B85
Base 36EX1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnineteen thousand, three hundred and thirty-three
Ordinalnineteen thousand, three hundred and thirty-third
Scientific notation1.9333 × 10^4
Engineering notation19.333 × 10^3

In other bases

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

Bit-level

0100101110000101
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
Bytes24b 85
Gray code110111001000111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0100101110000101
32-bit00000000000000000100101110000101
64-bit0000000000000000000000000000000000000000000000000100101110000101
One's complement1011010001111010at 16 bits, every bit flipped
Bits reversed1010000111010010at 16 bits
Rotated left by 11001011100001010at 16 bits, wrapping
Shifted left by 11001011100001010= 38,666, no wrap
Shifted right by 110010111000010= 9,666, discarding the low bit
These bits as a double9.55177113 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime19,373+40
Previous prime19,319−14
Distance to nearest prime0, it is prime
Nearest square below19,321
Nearest square above19,600

Powers & multiples

19,333 to the power 2373,764,889
19,333 to the power 37,225,996,599,037
19,333 to the power 4139,700,192,249,182,321
19,333 to the power 52,700,823,816,753,441,811,893
First ten multiples19,333, 38,666, 57,999, 77,332, 96,665, 115,998, 135,331, 154,664, 173,997, 193,330
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 174the total stopping time
Highest value reached69,7123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps19,333 → 58,000 → 29,000 → 14,500 → 7,250 → 3,625 → 10,876 → 5,438 → 2,719 → 8,158 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,933,300%
19,333% as a decimal193.33
19,333% of 10019,333
19,333% of 1,000193,330
As a fraction of 10019,333/100

Read another way

As bytes18.88 KiB
As a 24-bit colour#004B85

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