Recognised as Number
1,379,377
- Positive
- Odd
- Composite
- 7 digits
1,379,377 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,379,377
Digit count7
Digit sum37
Digit product27,783
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation83 × 16,619
Distinct prime factors283, 16,619
Number of divisors4
Sum of divisors σ(n)1,396,080
Aliquot sum16,703sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,362,676integers below n that share no factor with it
Carmichael function λ(n)681,338the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,362,676
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 83, 16,619, 1,379,3774 in total
Arithmetic
Previous number1,379,376
Next number1,379,378
Double2,758,754
Half689,688.5
Square1,902,680,908,129
Cube2,624,514,283,012,255,633
Square root1,174.468816104≈irrational, shown to 9 decimal places
Cube root111.316871802≈
Negation-1,379,377
Reciprocal7.24964966 × 10^-7≈
Representations
Decimal1,379,377
Binary10101000011000011000121 bits
Octal5206061
Hexadecimal150C31
Base 36TKC1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and seventy-nine thousand, three hundred and seventy-seven
Ordinalone million, three hundred and seventy-nine thousand, three hundred and seventy-seventh
Scientific notation1.379377 × 10^6
Engineering notation1.379377 × 10^6
In other bases
Ternary2121002011001base 3; the most digit-efficient integer base after e: 13 digits
Quinary323120002base 5; one hand: 9 digits
Septenary14503336base 7: 8 digits
Nonary2532131base 9; each digit is two ternary digits: 7 digits
Duodecimal566301base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8c88hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:23:9:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT101T011001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010001110001110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010000110000110001
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 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 0c 31
Gray code111111000101000101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010000110000110001
64-bit0000000000000000000000000000000000000000000101010000110000110001
One's complement11111111111010101111001111001110at 32 bits, every bit flipped
Bits reversed10001100001100001010100000000000at 32 bits
Rotated left by 100000000001010100001100001100010at 32 bits, wrapping
Shifted left by 11010100001100001100010= 2,758,754, no wrap
Shifted right by 110101000011000011000= 689,688, discarding the low bit
These bits as a double6.81502788 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,379,377 to the power 21,902,680,908,129
1,379,377 to the power 32,624,514,283,012,255,633
1,379,377 to the power 43,620,194,638,158,596,138,280,641
1,379,377 to the power 54,993,613,219,399,289,865,433,135,740,657
First ten multiples1,379,377, 2,758,754, 4,138,131, 5,517,508, 6,896,885, 8,276,262, 9,655,639, 11,035,016, 12,414,393, 13,793,770
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached4,138,1323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,379,377 → 4,138,132 → 2,069,066 → 1,034,533 → 3,103,600 → 1,551,800 → 775,900 → 387,950 → 193,975 → 581,926 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage137,937,700%
1,379,377% as a decimal13,793.77
1,379,377% of 1001,379,377
1,379,377% of 1,00013,793,770
As a fraction of 1001,379,377/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,379,377
Nerdulate something else
Nothing in mind? Surprise me · today’s page