Recognised as Number
3,700,289
- Positive
- Odd
- Prime
- 7 digits
3,700,289 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,700,289
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation3,700,289
Distinct prime factors13,700,289
Number of divisors2
Sum of divisors σ(n)3,700,290
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,700,288integers below n that share no factor with it
Carmichael function λ(n)3,700,288the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3,700,2892 in total
Arithmetic
Previous number3,700,288
Next number3,700,290
Double7,400,578
Half1,850,144.5
Square13,692,138,683,521
Cube50,664,870,157,107,237,569
Square root1,923.613526673≈irrational, shown to 9 decimal places
Cube root154.672064215≈
Negation-3,700,289
Reciprocal2.70249162 × 10^-7≈
Representations
Decimal3,700,289
Binary111000011101100100000122 bits
Octal16073101
Hexadecimal387641
Base 3627B5T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred thousand, two hundred and eighty-nine
Ordinalthree million, seven hundred thousand, two hundred and eighty-ninth
Scientific notation3.700289 × 10^6
Engineering notation3.700289 × 10^6
In other bases
Ternary20221222211202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1421402124base 5; one hand: 10 digits
Septenary43311005base 7: 8 digits
Nonary6858752base 9; each digit is two ternary digits: 7 digits
Duodecimal12a5455base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal132ae9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:7:51:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T100T0000TTT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010011000101001000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000111011001000001
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
Bytes338 76 41
Gray code1001000100110101100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000111011001000001
64-bit0000000000000000000000000000000000000000001110000111011001000001
One's complement11111111110001111000100110111110at 32 bits, every bit flipped
Bits reversed10000010011011100001110000000000at 32 bits
Rotated left by 100000000011100001110110010000010at 32 bits, wrapping
Shifted left by 111100001110110010000010= 7,400,578, no wrap
Shifted right by 1111000011101100100000= 1,850,144, discarding the low bit
These bits as a double1.82818567 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,700,289 to the power 213,692,138,683,521
3,700,289 to the power 350,664,870,157,107,237,569
3,700,289 to the power 4187,474,661,728,772,182,996,957,441
3,700,289 to the power 5693,710,428,573,696,692,249,628,652,400,449
First ten multiples3,700,289, 7,400,578, 11,100,867, 14,801,156, 18,501,445, 22,201,734, 25,902,023, 29,602,312, 33,302,601, 37,002,890
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1216the total stopping time
Highest value reached11,100,8683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,700,289 → 11,100,868 → 5,550,434 → 2,775,217 → 8,325,652 → 4,162,826 → 2,081,413 → 6,244,240 → 3,122,120 → 1,561,060 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage370,028,900%
3,700,289% as a decimal37,002.89
3,700,289% of 1003,700,289
3,700,289% of 1,00037,002,890
As a fraction of 1003,700,289/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,700,289
Nerdulate something else
Nothing in mind? Surprise me · today’s page