Recognised as Number
3,737,441
- Positive
- Odd
- Composite
- 7 digits
3,737,441 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,737,441
Digit count7
Digit sum29
Digit product7,056
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation349 × 10,709
Distinct prime factors2349, 10,709
Number of divisors4
Sum of divisors σ(n)3,748,500
Aliquot sum11,059sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,726,384integers below n that share no factor with it
Carmichael function λ(n)931,596the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,726,384
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 349, 10,709, 3,737,4414 in total
Arithmetic
Previous number3,737,440
Next number3,737,442
Double7,474,882
Half1,868,720.5
Square13,968,465,228,481
Cube52,206,314,651,999,257,121
Square root1,933.24623367≈irrational, shown to 9 decimal places
Cube root155.187992504≈
Negation-3,737,441
Reciprocal2.67562752 × 10^-7≈
Representations
Decimal3,737,441
Binary111001000001110110000122 bits
Octal16203541
Hexadecimal390761
Base 36283TT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and thirty-seven thousand, four hundred and forty-one
Ordinalthree million, seven hundred and thirty-seven thousand, four hundred and forty-first
Scientific notation3.737441 × 10^6
Engineering notation3.737441 × 10^6
In other bases
Ternary21000212210202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1424044231base 5; one hand: 10 digits
Septenary43524221base 7: 8 digits
Nonary7025722base 9; each digit is two ternary digits: 7 digits
Duodecimal1302a55base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1373c1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:18:10:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10010T0T11T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010010001100010100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110010000011101100001
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes339 07 61
Gray code1001011000010011010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110010000011101100001
64-bit0000000000000000000000000000000000000000001110010000011101100001
One's complement11111111110001101111100010011110at 32 bits, every bit flipped
Bits reversed10000110111000001001110000000000at 32 bits
Rotated left by 100000000011100100000111011000010at 32 bits, wrapping
Shifted left by 111100100000111011000010= 7,474,882, no wrap
Shifted right by 1111001000001110110000= 1,868,720, discarding the low bit
These bits as a double1.8465412 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,737,441 to the power 213,968,465,228,481
3,737,441 to the power 352,206,314,651,999,257,121
3,737,441 to the power 4195,118,020,839,282,755,533,567,361
3,737,441 to the power 5729,242,090,923,589,781,124,131,531,263,201
First ten multiples3,737,441, 7,474,882, 11,212,323, 14,949,764, 18,687,205, 22,424,646, 26,162,087, 29,899,528, 33,636,969, 37,374,410
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1110the total stopping time
Highest value reached15,964,4324× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,737,441 → 11,212,324 → 5,606,162 → 2,803,081 → 8,409,244 → 4,204,622 → 2,102,311 → 6,306,934 → 3,153,467 → 9,460,402 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage373,744,100%
3,737,441% as a decimal37,374.41
3,737,441% of 1003,737,441
3,737,441% of 1,00037,374,410
As a fraction of 1003,737,441/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 3,737,441
Nerdulate something else
Nothing in mind? Surprise me · today’s page