Recognised as Number
1,360,726
- Positive
- Even
- Composite
- 7 digits
1,360,726 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,360,726
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 23 × 29,581
Distinct prime factors32, 23, 29,581
Number of divisors8
Sum of divisors σ(n)2,129,904
Aliquot sum769,178sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)650,760integers below n that share no factor with it
Carmichael function λ(n)325,380the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 650,760
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 23, 46, 29,581, 59,162, 680,363, 1,360,7268 in total
Arithmetic
Previous number1,360,725
Next number1,360,727
Double2,721,452
Half680,363
Square1,851,575,247,076
Cube2,519,486,579,652,737,176
Square root1,166.501607371≈irrational, shown to 9 decimal places
Cube root110.812876294≈
Negation-1,360,726
Reciprocal7.3490181 × 10^-7≈
Representations
Decimal1,360,726
Binary10100110000110101011021 bits
Octal5141526
Hexadecimal14C356
Base 36T5XY
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and sixty thousand, seven hundred and twenty-six
Ordinalone million, three hundred and sixty thousand, seven hundred and twenty-sixth
Scientific notation1.360726 × 10^6
Engineering notation1.360726 × 10^6
In other bases
Ternary2120010120021base 3; the most digit-efficient integer base after e: 13 digits
Quinary322020401base 5; one hand: 9 digits
Septenary14365063base 7: 8 digits
Nonary2503507base 9; each digit is two ternary digits: 7 digits
Duodecimal55755abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8a1g6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:17:58:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT0011TT01T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011100010010101010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001100001101010110
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
Bytes314 c3 56
Gray code111101010001011111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001100001101010110
64-bit0000000000000000000000000000000000000000000101001100001101010110
One's complement11111111111010110011110010101001at 32 bits, every bit flipped
Bits reversed01101010110000110010100000000000at 32 bits
Rotated left by 100000000001010011000011010101100at 32 bits, wrapping
Shifted left by 11010011000011010101100= 2,721,452, no wrap
Shifted right by 110100110000110101011= 680,363, discarding the low bit
These bits as a double6.7228797 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,360,726 to the power 21,851,575,247,076
1,360,726 to the power 32,519,486,579,652,737,176
1,360,726 to the power 43,428,330,895,584,550,446,549,776
1,360,726 to the power 54,665,018,986,225,182,990,931,890,497,376
First ten multiples1,360,726, 2,721,452, 4,082,178, 5,442,904, 6,803,630, 8,164,356, 9,525,082, 10,885,808, 12,246,534, 13,607,260
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 6
Divisible by 9No, remainder 7
Divisible by 10No, remainder 6
Divisible by 11No, remainder 4
Divisible by 12No, remainder 10
Divisible by 100No, remainder 26
Collatz (3n + 1) trajectory
Steps to reach 1124the total stopping time
Highest value reached4,359,2563× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,360,726 → 680,363 → 2,041,090 → 1,020,545 → 3,061,636 → 1,530,818 → 765,409 → 2,296,228 → 1,148,114 → 574,057 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage136,072,600%
1,360,726% as a decimal13,607.26
1,360,726% of 1001,360,726
1,360,726% of 1,00013,607,260
As a fraction of 1001,360,726/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,360,726
Nerdulate something else
Nothing in mind? Surprise me · today’s page