Recognised as Number
3,625,027
- Positive
- Odd
- Composite
- 7 digits
3,625,027 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,625,027
Digit count7
Digit sum25
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 factorisation7 × 517,861
Distinct prime factors27, 517,861
Number of divisors4
Sum of divisors σ(n)4,142,896
Aliquot sum517,869sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,107,160integers below n that share no factor with it
Carmichael function λ(n)517,860the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,107,160
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 517,861, 3,625,0274 in total
Arithmetic
Previous number3,625,026
Next number3,625,028
Double7,250,054
Half1,812,513.5
Square13,140,820,750,729
Cube47,635,830,023,552,894,683
Square root1,903.950367≈irrational, shown to 9 decimal places
Cube root153.616222674≈
Negation-3,625,027
Reciprocal2.75860014 × 10^-7≈
Representations
Decimal3,625,027
Binary110111010100000100001122 bits
Octal15650103
Hexadecimal375043
Base 3625P37
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and twenty-five thousand and twenty-seven
Ordinalthree million, six hundred and twenty-five thousand and twenty-seventh
Scientific notation3.625027 × 10^6
Engineering notation3.625027 × 10^6
In other bases
Ternary20211011121021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1412000102base 5; one hand: 10 digits
Septenary42545410base 7: 8 digits
Nonary6734537base 9; each digit is two ternary digits: 7 digits
Duodecimal1269997base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12d2b7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:46:57:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T111TTTT11T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110101000001000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110101000001000011
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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
Bytes337 50 43
Gray code1011001111100001100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110101000001000011
64-bit0000000000000000000000000000000000000000001101110101000001000011
One's complement11111111110010001010111110111100at 32 bits, every bit flipped
Bits reversed11000010000010101110110000000000at 32 bits
Rotated left by 100000000011011101010000010000110at 32 bits, wrapping
Shifted left by 111011101010000010000110= 7,250,054, no wrap
Shifted right by 1110111010100000100001= 1,812,513, discarding the low bit
These bits as a double1.79100131 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,625,027 to the power 213,140,820,750,729
3,625,027 to the power 347,635,830,023,552,894,683
3,625,027 to the power 4172,681,170,002,789,879,154,031,441
3,625,027 to the power 5625,973,903,651,703,387,260,101,132,473,907
First ten multiples3,625,027, 7,250,054, 10,875,081, 14,500,108, 18,125,135, 21,750,162, 25,375,189, 29,000,216, 32,625,243, 36,250,270
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 27
Collatz (3n + 1) trajectory
Steps to reach 1203the total stopping time
Highest value reached16,312,6244× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,625,027 → 10,875,082 → 5,437,541 → 16,312,624 → 8,156,312 → 4,078,156 → 2,039,078 → 1,019,539 → 3,058,618 → 1,529,309 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage362,502,700%
3,625,027% as a decimal36,250.27
3,625,027% of 1003,625,027
3,625,027% of 1,00036,250,270
As a fraction of 1003,625,027/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,625,027
Nerdulate something else
Nothing in mind? Surprise me · today’s page