Recognised as Number
1,376,337
- Positive
- Odd
- Composite
- 7 digits
1,376,337 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,376,337
Digit count7
Digit sum30
Digit product7,938
Multiplicative persistence4times 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 × 17 × 26,987
Distinct prime factors33, 17, 26,987
Number of divisors8
Sum of divisors σ(n)1,943,136
Aliquot sum566,799sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)863,552integers below n that share no factor with it
Carmichael function λ(n)215,888the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 863,552
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 17, 51, 26,987, 80,961, 458,779, 1,376,3378 in total
Arithmetic
Previous number1,376,336
Next number1,376,338
Double2,752,674
Half688,168.5
Square1,894,303,537,569
Cube2,607,200,047,987,104,753
Square root1,173.173900153≈irrational, shown to 9 decimal places
Cube root111.235034809≈
Negation-1,376,337
Reciprocal7.26566241 × 10^-7≈
Representations
Decimal1,376,337
Binary10101000000000101000121 bits
Octal5200121
Hexadecimal150051
Base 36THZL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and seventy-six thousand, three hundred and thirty-seven
Ordinalone million, three hundred and seventy-six thousand, three hundred and thirty-seventh
Scientific notation1.376337 × 10^6
Engineering notation1.376337 × 10^6
In other bases
Ternary2120220222110base 3; the most digit-efficient integer base after e: 13 digits
Quinary323020322base 5; one hand: 9 digits
Septenary14461434base 7: 8 digits
Nonary2526873base 9; each digit is two ternary digits: 7 digits
Duodecimal5645a9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8c0ghbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:22:18:57base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT10T100T110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010000000001010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010000000001010001
Bit length21 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits15within that length
Bit parityeven6 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 00 51
Gray code111111000000001111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010000000001010001
64-bit0000000000000000000000000000000000000000000101010000000001010001
One's complement11111111111010101111111110101110at 32 bits, every bit flipped
Bits reversed10001010000000001010100000000000at 32 bits
Rotated left by 100000000001010100000000010100010at 32 bits, wrapping
Shifted left by 11010100000000010100010= 2,752,674, no wrap
Shifted right by 110101000000000101000= 688,168, discarding the low bit
These bits as a double6.80000829 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,376,337 to the power 21,894,303,537,569
1,376,337 to the power 32,607,200,047,987,104,753
1,376,337 to the power 43,588,385,892,446,427,794,429,761
1,376,337 to the power 54,938,828,274,052,039,091,302,073,965,457
First ten multiples1,376,337, 2,752,674, 4,129,011, 5,505,348, 6,881,685, 8,258,022, 9,634,359, 11,010,696, 12,387,033, 13,763,370
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 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 9
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1106the total stopping time
Highest value reached4,129,0123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,376,337 → 4,129,012 → 2,064,506 → 1,032,253 → 3,096,760 → 1,548,380 → 774,190 → 387,095 → 1,161,286 → 580,643 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage137,633,700%
1,376,337% as a decimal13,763.37
1,376,337% of 1001,376,337
1,376,337% of 1,00013,763,370
As a fraction of 1001,376,337/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,376,337
Nerdulate something else
Nothing in mind? Surprise me · today’s page