Recognised as Number
3,670,358
- Positive
- Even
- Composite
- 7 digits
3,670,358 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,670,358
Digit count7
Digit sum32
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 131 × 14,009
Distinct prime factors32, 131, 14,009
Number of divisors8
Sum of divisors σ(n)5,547,960
Aliquot sum1,877,602sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,821,040integers below n that share no factor with it
Carmichael function λ(n)910,520the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,821,040
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 131, 262, 14,009, 28,018, 1,835,179, 3,670,3588 in total
Arithmetic
Previous number3,670,357
Next number3,670,359
Double7,340,716
Half1,835,179
Square13,471,527,848,164
Cube49,445,330,009,731,522,712
Square root1,915.817841028≈irrational, shown to 9 decimal places
Cube root154.253896127≈
Negation-3,670,358
Reciprocal2.72452987 × 10^-7≈
Representations
Decimal3,670,358
Binary111000000000010101011022 bits
Octal16000526
Hexadecimal380156
Base 3626O2E
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and seventy thousand, three hundred and fifty-eight
Ordinalthree million, six hundred and seventy thousand, three hundred and fifty-eighth
Scientific notation3.670358 × 10^6
Engineering notation3.670358 × 10^6
In other bases
Ternary20220110210012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1414422413base 5; one hand: 10 digits
Septenary43124516base 7: 8 digits
Nonary6813705base 9; each digit is two ternary digits: 7 digits
Duodecimal1290072base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12ifhibase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:59:32:38base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T0111T101TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000000011010101010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000000000101010110
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes338 01 56
Gray code1001000000000111111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000000000101010110
64-bit0000000000000000000000000000000000000000001110000000000101010110
One's complement11111111110001111111111010101001at 32 bits, every bit flipped
Bits reversed01101010100000000001110000000000at 32 bits
Rotated left by 100000000011100000000001010101100at 32 bits, wrapping
Shifted left by 111100000000001010101100= 7,340,716, no wrap
Shifted right by 1111000000000010101011= 1,835,179, discarding the low bit
These bits as a double1.8133978 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,670,358 to the power 213,471,527,848,164
3,670,358 to the power 349,445,330,009,731,522,712
3,670,358 to the power 4181,482,062,563,858,172,238,170,896
3,670,358 to the power 5666,104,140,187,757,353,339,748,453,500,768
First ten multiples3,670,358, 7,340,716, 11,011,074, 14,681,432, 18,351,790, 22,022,148, 25,692,506, 29,362,864, 33,033,222, 36,703,580
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 5
Divisible by 10No, remainder 8
Divisible by 11No, remainder 10
Divisible by 12No, remainder 2
Divisible by 100No, remainder 58
Collatz (3n + 1) trajectory
Steps to reach 1159the total stopping time
Highest value reached8,258,3082× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,670,358 → 1,835,179 → 5,505,538 → 2,752,769 → 8,258,308 → 4,129,154 → 2,064,577 → 6,193,732 → 3,096,866 → 1,548,433 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage367,035,800%
3,670,358% as a decimal36,703.58
3,670,358% of 1003,670,358
3,670,358% of 1,00036,703,580
As a fraction of 1003,670,358/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,670,358
Nerdulate something else
Nothing in mind? Surprise me · today’s page