Recognised as Number
1,396,383
- Positive
- Odd
- Composite
- 7 digits
1,396,383 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,396,383
Digit count7
Digit sum33
Digit product11,664
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 199 × 2,339
Distinct prime factors33, 199, 2,339
Number of divisors8
Sum of divisors σ(n)1,872,000
Aliquot sum475,617sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)925,848integers below n that share no factor with it
Carmichael function λ(n)231,462the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 925,848
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 199, 597, 2,339, 7,017, 465,461, 1,396,3838 in total
Arithmetic
Previous number1,396,382
Next number1,396,384
Double2,792,766
Half698,191.5
Square1,949,885,482,689
Cube2,722,786,939,973,713,887
Square root1,181.686506651≈irrational, shown to 9 decimal places
Cube root111.772470695≈
Negation-1,396,383
Reciprocal7.16135903 × 10^-7≈
Representations
Decimal1,396,383
Binary10101010011101001111121 bits
Octal5247237
Hexadecimal154E9F
Base 36TXGF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and ninety-six thousand, three hundred and eighty-three
Ordinalone million, three hundred and ninety-six thousand, three hundred and eighty-third
Scientific notation1.396383 × 10^6
Engineering notation1.396383 × 10^6
In other bases
Ternary2121221110220base 3; the most digit-efficient integer base after e: 13 digits
Quinary324141013base 5; one hand: 9 digits
Septenary14604042base 7: 8 digits
Nonary2557426base 9; each digit is two ternary digits: 7 digits
Duodecimal574113base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8eaj3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:27:53:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T0T11110T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010101001111100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010100111010011111
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes315 4e 9f
Gray code111111110100111010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010100111010011111
64-bit0000000000000000000000000000000000000000000101010100111010011111
One's complement11111111111010101011000101100000at 32 bits, every bit flipped
Bits reversed11111001011100101010100000000000at 32 bits
Rotated left by 100000000001010101001110100111110at 32 bits, wrapping
Shifted left by 11010101001110100111110= 2,792,766, no wrap
Shifted right by 110101010011101001111= 698,191, discarding the low bit
These bits as a double6.89904869 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,396,383 to the power 21,949,885,482,689
1,396,383 to the power 32,722,786,939,973,713,887
1,396,383 to the power 43,802,053,395,601,314,518,670,721
1,396,383 to the power 55,309,122,726,709,950,371,524,977,402,143
First ten multiples1,396,383, 2,792,766, 4,189,149, 5,585,532, 6,981,915, 8,378,298, 9,774,681, 11,171,064, 12,567,447, 13,963,830
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 83
Collatz (3n + 1) trajectory
Steps to reach 1181the total stopping time
Highest value reached35,787,79625× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,396,383 → 4,189,150 → 2,094,575 → 6,283,726 → 3,141,863 → 9,425,590 → 4,712,795 → 14,138,386 → 7,069,193 → 21,207,580 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage139,638,300%
1,396,383% as a decimal13,963.83
1,396,383% of 1001,396,383
1,396,383% of 1,00013,963,830
As a fraction of 1001,396,383/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,396,383
Nerdulate something else
Nothing in mind? Surprise me · today’s page