Recognised as Number
3,607,357
- Positive
- Odd
- Composite
- 7 digits
3,607,357 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,607,357
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation13 × 61 × 4,549
Distinct prime factors313, 61, 4,549
Number of divisors8
Sum of divisors σ(n)3,949,400
Aliquot sum342,043sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,274,560integers below n that share no factor with it
Carmichael function λ(n)22,740the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,274,560
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 61, 793, 4,549, 59,137, 277,489, 3,607,3578 in total
Arithmetic
Previous number3,607,356
Next number3,607,358
Double7,214,714
Half1,803,678.5
Square13,013,024,525,449
Cube46,942,625,113,050,128,293
Square root1,899.304346333≈irrational, shown to 9 decimal places
Cube root153.366218005≈
Negation-3,607,357
Reciprocal2.77211266 × 10^-7≈
Representations
Decimal3,607,357
Binary110111000010110011110122 bits
Octal15605475
Hexadecimal370B3D
Base 3625BGD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and seven thousand, three hundred and fifty-seven
Ordinalthree million, six hundred and seven thousand, three hundred and fifty-seventh
Scientific notation3.607357 × 10^6
Engineering notation3.607357 × 10^6
In other bases
Ternary20210021100211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1410413412base 5; one hand: 10 digits
Septenary42443035base 7: 8 digits
Nonary6707324base 9; each digit is two ternary digits: 7 digits
Duodecimal125b711base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12ai7hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:42:2:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T101T1101T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110001111101001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110000101100111101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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
Bytes337 0b 3d
Gray code1011001000111010100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110000101100111101
64-bit0000000000000000000000000000000000000000001101110000101100111101
One's complement11111111110010001111010011000010at 32 bits, every bit flipped
Bits reversed10111100110100001110110000000000at 32 bits
Rotated left by 100000000011011100001011001111010at 32 bits, wrapping
Shifted left by 111011100001011001111010= 7,214,714, no wrap
Shifted right by 1110111000010110011110= 1,803,678, discarding the low bit
These bits as a double1.78227117 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,607,357 to the power 213,013,024,525,449
3,607,357 to the power 346,942,625,113,050,128,293
3,607,357 to the power 4169,338,807,299,937,171,648,651,601
3,607,357 to the power 5610,865,531,885,079,455,706,964,893,428,557
First ten multiples3,607,357, 7,214,714, 10,822,071, 14,429,428, 18,036,785, 21,644,142, 25,251,499, 28,858,856, 32,466,213, 36,073,570
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 57
Collatz (3n + 1) trajectory
Steps to reach 1265the total stopping time
Highest value reached487,463,344135× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,607,357 → 10,822,072 → 5,411,036 → 2,705,518 → 1,352,759 → 4,058,278 → 2,029,139 → 6,087,418 → 3,043,709 → 9,131,128 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,735,700%
3,607,357% as a decimal36,073.57
3,607,357% of 1003,607,357
3,607,357% of 1,00036,073,570
As a fraction of 1003,607,357/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,607,357
Nerdulate something else
Nothing in mind? Surprise me · today’s page