Recognised as Number
3,704,749
- Positive
- Odd
- Prime
- 7 digits
3,704,749 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,704,749
Digit count7
Digit sum34
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,704,749
Distinct prime factors13,704,749
Number of divisors2
Sum of divisors σ(n)3,704,750
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,704,748integers below n that share no factor with it
Carmichael function λ(n)3,704,748the 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,7492 in total
Arithmetic
Previous number3,704,748
Next number3,704,750
Double7,409,498
Half1,852,374.5
Square13,725,165,153,001
Cube50,848,291,875,415,301,749
Square root1,924.772454084≈irrational, shown to 9 decimal places
Cube root154.734181925≈
Negation-3,704,749
Reciprocal2.69923819 × 10^-7≈
Representations
Decimal3,704,749
Binary111000100001111010110122 bits
Octal16103655
Hexadecimal3887AD
Base 3627ELP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and four thousand, seven hundred and forty-nine
Ordinalthree million, seven hundred and four thousand, seven hundred and forty-ninth
Scientific notation3.704749 × 10^6
Engineering notation3.704749 × 10^6
In other bases
Ternary20222012221221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1422022444base 5; one hand: 10 digits
Septenary43330006base 7: 8 digits
Nonary6865857base 9; each digit is two ternary digits: 7 digits
Duodecimal12a7b51base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1331h9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:9:5:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T100T1T000T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010011001100011111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110001000011110101101
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 ad
Gray code1001001100010001111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110001000011110101101
64-bit0000000000000000000000000000000000000000001110001000011110101101
One's complement11111111110001110111100001010010at 32 bits, every bit flipped
Bits reversed10110101111000010001110000000000at 32 bits
Rotated left by 100000000011100010000111101011010at 32 bits, wrapping
Shifted left by 111100010000111101011010= 7,409,498, no wrap
Shifted right by 1111000100001111010110= 1,852,374, discarding the low bit
These bits as a double1.83038921 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,704,749 to the power 213,725,165,153,001
3,704,749 to the power 350,848,291,875,415,301,749
3,704,749 to the power 4188,380,158,477,152,963,739,306,001
3,704,749 to the power 5697,901,203,738,073,965,260,230,167,898,749
First ten multiples3,704,749, 7,409,498, 11,114,247, 14,818,996, 18,523,745, 22,228,494, 25,933,243, 29,637,992, 33,342,741, 37,047,490
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached33,797,7169× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,704,749 → 11,114,248 → 5,557,124 → 2,778,562 → 1,389,281 → 4,167,844 → 2,083,922 → 1,041,961 → 3,125,884 → 1,562,942 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage370,474,900%
3,704,749% as a decimal37,047.49
3,704,749% of 1003,704,749
3,704,749% of 1,00037,047,490
As a fraction of 1003,704,749/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,749
Nerdulate something else
Nothing in mind? Surprise me · today’s page