Recognised as Number
1,363,630
- Positive
- Even
- Composite
- 7 digits
1,363,630 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,363,630
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 5 × 19 × 7,177
Distinct prime factors42, 5, 19, 7,177
Number of divisors16
Sum of divisors σ(n)2,584,080
Aliquot sum1,220,450sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)516,672integers below n that share no factor with it
Carmichael function λ(n)21,528the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 516,672
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 19, 38, 95, 190, 7,177, 14,354, 35,885, 71,770, 136,363, 272,726, 681,815, 1,363,63016 in total
Arithmetic
Previous number1,363,629
Next number1,363,631
Double2,727,260
Half681,815
Square1,859,486,776,900
Cube2,535,651,953,584,147,000
Square root1,167.745691493≈irrational, shown to 9 decimal places
Cube root110.891650894≈
Negation-1,363,630
Reciprocal7.33336756 × 10^-7≈
Representations
Decimal1,363,630
Binary10100110011101010111021 bits
Octal5147256
Hexadecimal14CEAE
Base 36T86M
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and sixty-three thousand, six hundred and thirty
Ordinalone million, three hundred and sixty-three thousand, six hundred and thirtieth
Scientific notation1.36363 × 10^6
Engineering notation1.36363 × 10^6
In other bases
Ternary2120021112211base 3; the most digit-efficient integer base after e: 13 digits
Quinary322114010base 5; one hand: 9 digits
Septenary14406412base 7: 8 digits
Nonary2507484base 9; each digit is two ternary digits: 7 digits
Duodecimal55917abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8a91abase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:18:47:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT010TTT0T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011101001111110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001100111010101110
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes314 ce ae
Gray code111101010100111111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001100111010101110
64-bit0000000000000000000000000000000000000000000101001100111010101110
One's complement11111111111010110011000101010001at 32 bits, every bit flipped
Bits reversed01110101011100110010100000000000at 32 bits
Rotated left by 100000000001010011001110101011100at 32 bits, wrapping
Shifted left by 11010011001110101011100= 2,727,260, no wrap
Shifted right by 110100110011101010111= 681,815, discarding the low bit
These bits as a double6.73722737 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,363,630 to the power 21,859,486,776,900
1,363,630 to the power 32,535,651,953,584,147,000
1,363,630 to the power 43,457,691,073,465,950,373,610,000
1,363,630 to the power 54,715,011,278,510,373,907,965,804,300,000
First ten multiples1,363,630, 2,727,260, 4,090,890, 5,454,520, 6,818,150, 8,181,780, 9,545,410, 10,909,040, 12,272,670, 13,636,300
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 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8No, remainder 6
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 4
Divisible by 12No, remainder 10
Divisible by 100No, remainder 30
Collatz (3n + 1) trajectory
Steps to reach 1199the total stopping time
Highest value reached4,602,2563× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,363,630 → 681,815 → 2,045,446 → 1,022,723 → 3,068,170 → 1,534,085 → 4,602,256 → 2,301,128 → 1,150,564 → 575,282 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage136,363,000%
1,363,630% as a decimal13,636.3
1,363,630% of 1001,363,630
1,363,630% of 1,00013,636,300
As a fraction of 1001,363,630/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,363,630
Nerdulate something else
Nothing in mind? Surprise me · today’s page