Recognised as Number
3,704,761
- Positive
- Odd
- Prime
- 7 digits
3,704,761 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,704,761
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation3,704,761
Distinct prime factors13,704,761
Number of divisors2
Sum of divisors σ(n)3,704,762
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,704,760integers below n that share no factor with it
Carmichael function λ(n)3,704,760the 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,704,7612 in total
Arithmetic
Previous number3,704,760
Next number3,704,762
Double7,409,522
Half1,852,380.5
Square13,725,254,067,121
Cube50,848,785,982,961,263,081
Square root1,924.775571333≈irrational, shown to 9 decimal places
Cube root154.73434899≈
Negation-3,704,761
Reciprocal2.69922945 × 10^-7≈
Representations
Decimal3,704,761
Binary111000100001111011100122 bits
Octal16103671
Hexadecimal3887B9
Base 3627EM1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and four thousand, seven hundred and sixty-one
Ordinalthree million, seven hundred and four thousand, seven hundred and sixty-first
Scientific notation3.704761 × 10^6
Engineering notation3.704761 × 10^6
In other bases
Ternary20222012222101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1422023021base 5; one hand: 10 digits
Septenary43330024base 7: 8 digits
Nonary6865871base 9; each digit is two ternary digits: 7 digits
Duodecimal12a7b61base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1331i1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:9:6:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T100T1T000T101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010011001100011001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110001000011110111001
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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 87 b9
Gray code1001001100010001100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110001000011110111001
64-bit0000000000000000000000000000000000000000001110001000011110111001
One's complement11111111110001110111100001000110at 32 bits, every bit flipped
Bits reversed10011101111000010001110000000000at 32 bits
Rotated left by 100000000011100010000111101110010at 32 bits, wrapping
Shifted left by 111100010000111101110010= 7,409,522, no wrap
Shifted right by 1111000100001111011100= 1,852,380, discarding the low bit
These bits as a double1.83039514 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,704,761 to the power 213,725,254,067,121
3,704,761 to the power 350,848,785,982,961,263,081
3,704,761 to the power 4188,382,599,207,021,551,973,228,641
3,704,761 to the power 5697,912,506,620,804,371,909,890,513,259,801
First ten multiples3,704,761, 7,409,522, 11,114,283, 14,819,044, 18,523,805, 22,228,566, 25,933,327, 29,638,088, 33,342,849, 37,047,610
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1164the total stopping time
Highest value reached36,091,8169× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,704,761 → 11,114,284 → 5,557,142 → 2,778,571 → 8,335,714 → 4,167,857 → 12,503,572 → 6,251,786 → 3,125,893 → 9,377,680 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage370,476,100%
3,704,761% as a decimal37,047.61
3,704,761% of 1003,704,761
3,704,761% of 1,00037,047,610
As a fraction of 1003,704,761/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,704,761
Nerdulate something else
Nothing in mind? Surprise me · today’s page