Nerdulator> put something in

Recognised as Number

1,383,192

  • Positive
  • Even
  • Composite
  • 7 digits

1,383,192 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,383,192
Digit count7
Digit sum27
Digit product1,296
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 3^2 × 19,211
Distinct prime factors32, 3, 19,211
Number of divisors24
Sum of divisors σ(n)3,746,340
Aliquot sum2,363,148sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)461,040integers below n that share no factor with it
Carmichael function λ(n)57,630the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 461,040
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 19,211, 38,422, 57,633, 76,844, 115,266, 153,688, 172,899, 230,532, 345,798, 461,064, 691,596, 1,383,19224 in total

Arithmetic

Previous number1,383,191
Next number1,383,193
Double2,766,384
Cube2,646,350,748,819,813,888
Square root1,176.091833149≈irrational, shown to 9 decimal places
Cube root111.419401894≈
Negation-1,383,192
Reciprocal7.22965431 × 10^-7≈

Representations

Decimal1,383,192
Binary10101000110110001100021 bits
Octal5215430
Hexadecimal151B18
Base 36TNA0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and eighty-three thousand, one hundred and ninety-two
Ordinalone million, three hundred and eighty-three thousand, one hundred and ninety-second
Scientific notation1.383192 × 10^6
Engineering notation1.383192 × 10^6

In other bases

Ternary2121021101100base 3; the most digit-efficient integer base after e: 13 digits
Quinary323230232base 5; one hand: 9 digits
Septenary14520426base 7: 8 digits
Nonary2537340base 9; each digit is two ternary digits: 7 digits
Duodecimal568560base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8chjcbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:24:13:12base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT11T1101100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010110111101101000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101010001101100011000
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes315 1b 18
Gray code111111001011010010100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101010001101100011000
64-bit0000000000000000000000000000000000000000000101010001101100011000
One's complement11111111111010101110010011100111at 32 bits, every bit flipped
Bits reversed00011000110110001010100000000000at 32 bits
Rotated left by 100000000001010100011011000110000at 32 bits, wrapping
Shifted left by 11010100011011000110000= 2,766,384, no wrap
Shifted right by 110101000110110001100= 691,596, discarding the low bit
These bits as a double6.83387649 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,383,199+7
Previous prime1,383,191−1
Distance to nearest prime1
Nearest square below1,382,976
Nearest square above1,385,329

Powers & multiples

1,383,192 to the power 21,913,220,108,864
1,383,192 to the power 32,646,350,748,819,813,888
1,383,192 to the power 43,660,411,184,961,576,011,370,496
1,383,192 to the power 55,063,051,467,749,372,246,319,579,103,232
First ten multiples1,383,192, 2,766,384, 4,149,576, 5,532,768, 6,915,960, 8,299,152, 9,682,344, 11,065,536, 12,448,728, 13,831,920
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 8
Divisible by 12Yes
Divisible by 100No, remainder 92

Collatz (3n + 1) trajectory

Steps to reach 1168the total stopping time
Highest value reached1,383,192
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,383,192 → 691,596 → 345,798 → 172,899 → 518,698 → 259,349 → 778,048 → 389,024 → 194,512 → 97,256 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage138,319,200%
1,383,192% as a decimal13,831.92
1,383,192% of 1001,383,192
1,383,192% of 1,00013,831,920
As a fraction of 1001,383,192/100

Read another way

As bytes1.319 MiB
As a 24-bit colour#151B18

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