Recognised as Number
1,368,992
- Positive
- Even
- Composite
- 7 digits
1,368,992 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,368,992
Digit count7
Digit sum38
Digit product23,328
Multiplicative persistence5times 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^5 × 179 × 239
Distinct prime factors32, 179, 239
Number of divisors24
Sum of divisors σ(n)2,721,600
Aliquot sum1,352,608sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)677,824integers below n that share no factor with it
Carmichael function λ(n)84,728the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 677,824
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 179, 239, 358, 478, 716, 956, 1,432, 1,912, 2,864, 3,824, 5,728, 7,648, 42,781, 85,562, 171,124, 342,248, 684,496, 1,368,99224 in total
Arithmetic
Previous number1,368,991
Next number1,368,993
Double2,737,984
Half684,496
Square1,874,139,096,064
Cube2,565,681,429,398,847,488
Square root1,170.039315579≈irrational, shown to 9 decimal places
Cube root111.036808397≈
Negation-1,368,992
Reciprocal7.30464459 × 10^-7≈
Representations
Decimal1,368,992
Binary10100111000111010000021 bits
Octal5161640
Hexadecimal14E3A0
Base 36TCBK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and sixty-eight thousand, nine hundred and ninety-two
Ordinalone million, three hundred and sixty-eight thousand, nine hundred and ninety-second
Scientific notation1.368992 × 10^6
Engineering notation1.368992 × 10^6
In other bases
Ternary2120112220102base 3; the most digit-efficient integer base after e: 13 digits
Quinary322301432base 5; one hand: 9 digits
Septenary14431142base 7: 8 digits
Nonary2515812base 9; each digit is two ternary digits: 7 digits
Duodecimal5602a8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8b29cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:20:16:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT1TT00T011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010010010011100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001110001110100000
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 55 trailing zeros
Power of twoNo
Bytes314 e3 a0
Gray code111101001001001110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001110001110100000
64-bit0000000000000000000000000000000000000000000101001110001110100000
One's complement11111111111010110001110001011111at 32 bits, every bit flipped
Bits reversed00000101110001110010100000000000at 32 bits
Rotated left by 100000000001010011100011101000000at 32 bits, wrapping
Shifted left by 11010011100011101000000= 2,737,984, no wrap
Shifted right by 110100111000111010000= 684,496, discarding the low bit
These bits as a double6.76371917 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,368,992 to the power 21,874,139,096,064
1,368,992 to the power 32,565,681,429,398,847,488
1,368,992 to the power 43,512,397,351,395,587,020,292,096
1,368,992 to the power 54,808,443,874,881,747,466,083,717,087,232
First ten multiples1,368,992, 2,737,984, 4,106,976, 5,475,968, 6,844,960, 8,213,952, 9,582,944, 10,951,936, 12,320,928, 13,689,920
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 8
Divisible by 100No, remainder 92
Collatz (3n + 1) trajectory
Steps to reach 180the total stopping time
Highest value reached1,368,992
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,368,992 → 684,496 → 342,248 → 171,124 → 85,562 → 42,781 → 128,344 → 64,172 → 32,086 → 16,043 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage136,899,200%
1,368,992% as a decimal13,689.92
1,368,992% of 1001,368,992
1,368,992% of 1,00013,689,920
As a fraction of 1001,368,992/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,368,992
Nerdulate something else
Nothing in mind? Surprise me · today’s page