Recognised as Number
3,700,913
- Positive
- Odd
- Composite
- 7 digits
3,700,913 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,700,913
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation79^2 × 593
Distinct prime factors279, 593
Number of divisors6
Sum of divisors σ(n)3,754,674
Aliquot sum53,761sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,647,904integers below n that share no factor with it
Carmichael function λ(n)1,823,952the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,647,904
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 79, 593, 6,241, 46,847, 3,700,9136 in total
Arithmetic
Previous number3,700,912
Next number3,700,914
Double7,401,826
Half1,850,456.5
Square13,696,757,033,569
Cube50,690,506,163,376,948,497
Square root1,923.775714578≈irrational, shown to 9 decimal places
Cube root154.680758125≈
Negation-3,700,913
Reciprocal2.70203596 × 10^-7≈
Representations
Decimal3,700,913
Binary111000011110001011000122 bits
Octal16074261
Hexadecimal3878B1
Base 3627BN5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred thousand, nine hundred and thirteen
Ordinalthree million, seven hundred thousand, nine hundred and thirteenth
Scientific notation3.700913 × 10^6
Engineering notation3.700913 × 10^6
In other bases
Ternary20222000200212base 3; the most digit-efficient integer base after e: 14 digits
Quinary1421412123base 5; one hand: 10 digits
Septenary43312556base 7: 8 digits
Nonary6860625base 9; each digit is two ternary digits: 7 digits
Duodecimal12a5895base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal132c5dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:8:1:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T100T001T010TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010011000100111110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000111100010110001
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; 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 78 b1
Gray code1001000100010011101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000111100010110001
64-bit0000000000000000000000000000000000000000001110000111100010110001
One's complement11111111110001111000011101001110at 32 bits, every bit flipped
Bits reversed10001101000111100001110000000000at 32 bits
Rotated left by 100000000011100001111000101100010at 32 bits, wrapping
Shifted left by 111100001111000101100010= 7,401,826, no wrap
Shifted right by 1111000011110001011000= 1,850,456, discarding the low bit
These bits as a double1.82849397 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,700,913 to the power 213,696,757,033,569
3,700,913 to the power 350,690,506,163,376,948,497
3,700,913 to the power 4187,601,153,236,621,872,592,877,761
3,700,913 to the power 5694,295,546,828,405,964,363,325,013,095,793
First ten multiples3,700,913, 7,401,826, 11,102,739, 14,803,652, 18,504,565, 22,205,478, 25,906,391, 29,607,304, 33,308,217, 37,009,130
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1203the total stopping time
Highest value reached11,102,7403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,700,913 → 11,102,740 → 5,551,370 → 2,775,685 → 8,327,056 → 4,163,528 → 2,081,764 → 1,040,882 → 520,441 → 1,561,324 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage370,091,300%
3,700,913% as a decimal37,009.13
3,700,913% of 1003,700,913
3,700,913% of 1,00037,009,130
As a fraction of 1003,700,913/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,913
Nerdulate something else
Nothing in mind? Surprise me · today’s page