Recognised as Number
1,363,629
- Positive
- Odd
- Composite
- 7 digits
1,363,629 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,363,629
Digit count7
Digit sum30
Digit product5,832
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 454,543
Distinct prime factors23, 454,543
Number of divisors4
Sum of divisors σ(n)1,818,176
Aliquot sum454,547sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)909,084integers below n that share no factor with it
Carmichael function λ(n)454,542the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 909,084
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 454,543, 1,363,6294 in total
Arithmetic
Previous number1,363,628
Next number1,363,630
Double2,727,258
Half681,814.5
Square1,859,484,049,641
Cube2,535,646,375,127,907,189
Square root1,167.745263317≈irrational, shown to 9 decimal places
Cube root110.891623787≈
Negation-1,363,629
Reciprocal7.33337293 × 10^-7≈
Representations
Decimal1,363,629
Binary10100110011101010110121 bits
Octal5147255
Hexadecimal14CEAD
Base 36T86L
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and sixty-three thousand, six hundred and twenty-nine
Ordinalone million, three hundred and sixty-three thousand, six hundred and twenty-ninth
Scientific notation1.363629 × 10^6
Engineering notation1.363629 × 10^6
In other bases
Ternary2120021112210base 3; the most digit-efficient integer base after e: 13 digits
Quinary322114004base 5; one hand: 9 digits
Septenary14406411base 7: 8 digits
Nonary2507483base 9; each digit is two ternary digits: 7 digits
Duodecimal559179base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8a919base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:18:47:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT010TTT0T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011101001111111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001100111010101101
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 ce ad
Gray code111101010100111111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001100111010101101
64-bit0000000000000000000000000000000000000000000101001100111010101101
One's complement11111111111010110011000101010010at 32 bits, every bit flipped
Bits reversed10110101011100110010100000000000at 32 bits
Rotated left by 100000000001010011001110101011010at 32 bits, wrapping
Shifted left by 11010011001110101011010= 2,727,258, no wrap
Shifted right by 110100110011101010110= 681,814, discarding the low bit
These bits as a double6.73722243 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,363,629 to the power 21,859,484,049,641
1,363,629 to the power 32,535,646,375,127,907,189
1,363,629 to the power 43,457,680,930,869,292,952,228,881
1,363,629 to the power 54,714,993,990,080,363,079,154,916,769,149
First ten multiples1,363,629, 2,727,258, 4,090,887, 5,454,516, 6,818,145, 8,181,774, 9,545,403, 10,909,032, 12,272,661, 13,636,290
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1199the total stopping time
Highest value reached4,090,8883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,363,629 → 4,090,888 → 2,045,444 → 1,022,722 → 511,361 → 1,534,084 → 767,042 → 383,521 → 1,150,564 → 575,282 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage136,362,900%
1,363,629% as a decimal13,636.29
1,363,629% of 1001,363,629
1,363,629% of 1,00013,636,290
As a fraction of 1001,363,629/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,629
Nerdulate something else
Nothing in mind? Surprise me · today’s page