Recognised as Number
1,369,965
- Positive
- Odd
- Composite
- 7 digits
1,369,965 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,369,965
Digit count7
Digit sum39
Digit product43,740
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 5 × 91,331
Distinct prime factors33, 5, 91,331
Number of divisors8
Sum of divisors σ(n)2,191,968
Aliquot sum822,003sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)730,640integers below n that share no factor with it
Carmichael function λ(n)182,660the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 730,640
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 91,331, 273,993, 456,655, 1,369,9658 in total
Arithmetic
Previous number1,369,964
Next number1,369,966
Double2,739,930
Half684,982.5
Square1,876,804,101,225
Cube2,571,155,930,534,707,125
Square root1,170.455039717≈irrational, shown to 9 decimal places
Cube root111.063108339≈
Negation-1,369,965
Reciprocal7.29945656 × 10^-7≈
Representations
Decimal1,369,965
Binary10100111001110110110121 bits
Octal5163555
Hexadecimal14E76D
Base 36TD2L
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and sixty-nine thousand, nine hundred and sixty-five
Ordinalone million, three hundred and sixty-nine thousand, nine hundred and sixty-fifth
Scientific notation1.369965 × 10^6
Engineering notation1.369965 × 10^6
In other bases
Ternary2120121020110base 3; the most digit-efficient integer base after e: 13 digits
Quinary322314330base 5; one hand: 9 digits
Septenary14434032base 7: 8 digits
Nonary2517213base 9; each digit is two ternary digits: 7 digits
Duodecimal560979base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8b4i5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:20:32:45base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT1TT11T0110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010011100010111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001110011101101101
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 set bits, so odd; 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 e7 6d
Gray code111101001010011011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001110011101101101
64-bit0000000000000000000000000000000000000000000101001110011101101101
One's complement11111111111010110001100010010010at 32 bits, every bit flipped
Bits reversed10110110111001110010100000000000at 32 bits
Rotated left by 100000000001010011100111011011010at 32 bits, wrapping
Shifted left by 11010011100111011011010= 2,739,930, no wrap
Shifted right by 110100111001110110110= 684,982, discarding the low bit
These bits as a double6.76852643 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,369,965 to the power 21,876,804,101,225
1,369,965 to the power 32,571,155,930,534,707,125
1,369,965 to the power 43,522,393,634,374,980,046,500,625
1,369,965 to the power 54,825,555,995,316,519,539,404,228,728,125
First ten multiples1,369,965, 2,739,930, 4,109,895, 5,479,860, 6,849,825, 8,219,790, 9,589,755, 10,959,720, 12,329,685, 13,699,650
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 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 65
Collatz (3n + 1) trajectory
Steps to reach 1199the total stopping time
Highest value reached4,109,8963× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,369,965 → 4,109,896 → 2,054,948 → 1,027,474 → 513,737 → 1,541,212 → 770,606 → 385,303 → 1,155,910 → 577,955 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage136,996,500%
1,369,965% as a decimal13,699.65
1,369,965% of 1001,369,965
1,369,965% of 1,00013,699,650
As a fraction of 1001,369,965/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,369,965
Nerdulate something else
Nothing in mind? Surprise me · today’s page