Recognised as Number
1,387,565
- Positive
- Odd
- Composite
- 7 digits
1,387,565 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,387,565
Digit count7
Digit sum35
Digit product25,200
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 277,513
Distinct prime factors25, 277,513
Number of divisors4
Sum of divisors σ(n)1,665,084
Aliquot sum277,519sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,110,048integers below n that share no factor with it
Carmichael function λ(n)277,512the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,110,048
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 277,513, 1,387,5654 in total
Arithmetic
Previous number1,387,564
Next number1,387,566
Double2,775,130
Half693,782.5
Square1,925,336,629,225
Cube2,671,529,719,930,587,125
Square root1,177.949489579≈irrational, shown to 9 decimal places
Cube root111.536696884≈
Negation-1,387,565
Reciprocal7.20686959 × 10^-7≈
Representations
Decimal1,387,565
Binary10101001011000010110121 bits
Octal5226055
Hexadecimal152C2D
Base 36TQNH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and eighty-seven thousand, five hundred and sixty-five
Ordinalone million, three hundred and eighty-seven thousand, five hundred and sixty-fifth
Scientific notation1.387565 × 10^6
Engineering notation1.387565 × 10^6
In other bases
Ternary2121111101022base 3; the most digit-efficient integer base after e: 13 digits
Quinary323400230base 5; one hand: 9 digits
Septenary14536244base 7: 8 digits
Nonary2544338base 9; each digit is two ternary digits: 7 digits
Duodecimal56aba5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8d8i5base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:25:26:5base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT111110110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010111110001111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010010110000101101
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes315 2c 2d
Gray code111111011101000111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010010110000101101
64-bit0000000000000000000000000000000000000000000101010010110000101101
One's complement11111111111010101101001111010010at 32 bits, every bit flipped
Bits reversed10110100001101001010100000000000at 32 bits
Rotated left by 100000000001010100101100001011010at 32 bits, wrapping
Shifted left by 11010100101100001011010= 2,775,130, no wrap
Shifted right by 110101001011000010110= 693,782, discarding the low bit
These bits as a double6.85548198 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,387,565 to the power 21,925,336,629,225
1,387,565 to the power 32,671,529,719,930,587,125
1,387,565 to the power 43,706,921,135,835,485,124,100,625
1,387,565 to the power 55,143,594,025,845,564,916,222,683,728,125
First ten multiples1,387,565, 2,775,130, 4,162,695, 5,550,260, 6,937,825, 8,325,390, 9,712,955, 11,100,520, 12,488,085, 13,875,650
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 1
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 5
Divisible by 100No, remainder 65
Collatz (3n + 1) trajectory
Steps to reach 1106the total stopping time
Highest value reached4,162,6963× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,387,565 → 4,162,696 → 2,081,348 → 1,040,674 → 520,337 → 1,561,012 → 780,506 → 390,253 → 1,170,760 → 585,380 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage138,756,500%
1,387,565% as a decimal13,875.65
1,387,565% of 1001,387,565
1,387,565% of 1,00013,875,650
As a fraction of 1001,387,565/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,387,565
Nerdulate something else
Nothing in mind? Surprise me · today’s page