Recognised as Number
1,360,823
- Positive
- Odd
- Composite
- 7 digits
1,360,823 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,360,823
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation37 × 36,779
Distinct prime factors237, 36,779
Number of divisors4
Sum of divisors σ(n)1,397,640
Aliquot sum36,817sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,324,008integers below n that share no factor with it
Carmichael function λ(n)662,004the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,324,008
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 37, 36,779, 1,360,8234 in total
Arithmetic
Previous number1,360,822
Next number1,360,824
Double2,721,646
Half680,411.5
Square1,851,839,237,329
Cube2,520,025,426,459,761,767
Square root1,166.543183941≈irrational, shown to 9 decimal places
Cube root110.815509348≈
Negation-1,360,823
Reciprocal7.34849426 × 10^-7≈
Representations
Decimal1,360,823
Binary10100110000111011011121 bits
Octal5141667
Hexadecimal14C3B7
Base 36T60N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and sixty thousand, eight hundred and twenty-three
Ordinalone million, three hundred and sixty thousand, eight hundred and twenty-third
Scientific notation1.360823 × 10^6
Engineering notation1.360823 × 10^6
In other bases
Ternary2120010200212base 3; the most digit-efficient integer base after e: 13 digits
Quinary322021243base 5; one hand: 9 digits
Septenary14365262base 7: 8 digits
Nonary2503625base 9; each digit is two ternary digits: 7 digits
Duodecimal55761bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8a213base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:18:0:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT0011T010TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011100010011001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001100001110110111
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 set bits, so even; 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
Bytes314 c3 b7
Gray code111101010001001101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001100001110110111
64-bit0000000000000000000000000000000000000000000101001100001110110111
One's complement11111111111010110011110001001000at 32 bits, every bit flipped
Bits reversed11101101110000110010100000000000at 32 bits
Rotated left by 100000000001010011000011101101110at 32 bits, wrapping
Shifted left by 11010011000011101101110= 2,721,646, no wrap
Shifted right by 110100110000111011011= 680,411, discarding the low bit
These bits as a double6.72335894 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,360,823 to the power 21,851,839,237,329
1,360,823 to the power 32,520,025,426,459,761,767
1,360,823 to the power 43,429,308,560,911,252,387,054,241
1,360,823 to the power 54,666,681,963,784,933,207,108,313,400,343
First ten multiples1,360,823, 2,721,646, 4,082,469, 5,443,292, 6,804,115, 8,164,938, 9,525,761, 10,886,584, 12,247,407, 13,608,230
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached9,185,5606× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,360,823 → 4,082,470 → 2,041,235 → 6,123,706 → 3,061,853 → 9,185,560 → 4,592,780 → 2,296,390 → 1,148,195 → 3,444,586 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage136,082,300%
1,360,823% as a decimal13,608.23
1,360,823% of 1001,360,823
1,360,823% of 1,00013,608,230
As a fraction of 1001,360,823/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,823
Nerdulate something else
Nothing in mind? Surprise me · today’s page