Recognised as Number
1,392,146
- Positive
- Even
- Composite
- 7 digits
1,392,146 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,392,146
Digit count7
Digit sum26
Digit product1,296
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 7 × 99,439
Distinct prime factors32, 7, 99,439
Number of divisors8
Sum of divisors σ(n)2,386,560
Aliquot sum994,414sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)596,628integers below n that share no factor with it
Carmichael function λ(n)99,438the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 596,628
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 14, 99,439, 198,878, 696,073, 1,392,1468 in total
Arithmetic
Previous number1,392,145
Next number1,392,147
Double2,784,292
Half696,073
Square1,938,070,485,316
Cube2,698,077,073,850,728,136
Square root1,179.892367973≈irrational, shown to 9 decimal places
Cube root111.659306958≈
Negation-1,392,146
Reciprocal7.18315464 × 10^-7≈
Representations
Decimal1,392,146
Binary10101001111100001001021 bits
Octal5237022
Hexadecimal153E12
Base 36TU6Q
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and ninety-two thousand, one hundred and forty-six
Ordinalone million, three hundred and ninety-two thousand, one hundred and forty-sixth
Scientific notation1.392146 × 10^6
Engineering notation1.392146 × 10^6
In other bases
Ternary2121201122222base 3; the most digit-efficient integer base after e: 13 digits
Quinary324022041base 5; one hand: 9 digits
Septenary14555510base 7: 8 digits
Nonary2551588base 9; each digit is two ternary digits: 7 digits
Duodecimal571782base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8e076base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:26:42:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0TT1TT0000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010100001000010110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010011111000010010
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes315 3e 12
Gray code111111010000100011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010011111000010010
64-bit0000000000000000000000000000000000000000000101010011111000010010
One's complement11111111111010101100000111101101at 32 bits, every bit flipped
Bits reversed01001000011111001010100000000000at 32 bits
Rotated left by 100000000001010100111110000100100at 32 bits, wrapping
Shifted left by 11010100111110000100100= 2,784,292, no wrap
Shifted right by 110101001111100001001= 696,073, discarding the low bit
These bits as a double6.87811513 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,392,146 to the power 21,938,070,485,316
1,392,146 to the power 32,698,077,073,850,728,136
1,392,146 to the power 43,756,117,206,052,995,771,619,856
1,392,146 to the power 55,229,063,543,937,853,851,477,496,050,976
First ten multiples1,392,146, 2,784,292, 4,176,438, 5,568,584, 6,960,730, 8,352,876, 9,745,022, 11,137,168, 12,529,314, 13,921,460
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 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 8
Divisible by 10No, remainder 6
Divisible by 11No, remainder 8
Divisible by 12No, remainder 2
Divisible by 100No, remainder 46
Collatz (3n + 1) trajectory
Steps to reach 180the total stopping time
Highest value reached4,459,9123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,392,146 → 696,073 → 2,088,220 → 1,044,110 → 522,055 → 1,566,166 → 783,083 → 2,349,250 → 1,174,625 → 3,523,876 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage139,214,600%
1,392,146% as a decimal13,921.46
1,392,146% of 1001,392,146
1,392,146% of 1,00013,921,460
As a fraction of 1001,392,146/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,392,146
Nerdulate something else
Nothing in mind? Surprise me · today’s page