Recognised as Number
3,625,003
- Positive
- Odd
- Prime
- 7 digits
3,625,003 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,625,003
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,625,003
Distinct prime factors13,625,003
Number of divisors2
Sum of divisors σ(n)3,625,004
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,625,002integers below n that share no factor with it
Carmichael function λ(n)3,625,002the 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,625,0032 in total
Arithmetic
Previous number3,625,002
Next number3,625,004
Double7,250,006
Half1,812,501.5
Square13,140,646,750,009
Cube47,634,883,890,722,875,027
Square root1,903.944064304≈irrational, shown to 9 decimal places
Cube root153.615883661≈
Negation-3,625,003
Reciprocal2.75861841 × 10^-7≈
Representations
Decimal3,625,003
Binary110111010100000010101122 bits
Octal15650053
Hexadecimal37502B
Base 3625P2J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and twenty-five thousand and three
Ordinalthree million, six hundred and twenty-five thousand and third
Scientific notation3.625003 × 10^6
Engineering notation3.625003 × 10^6
In other bases
Ternary20211011120101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1412000003base 5; one hand: 10 digits
Septenary42545344base 7: 8 digits
Nonary6734511base 9; each digit is two ternary digits: 7 digits
Duodecimal1269977base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12d2a3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:46:56:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T111TTTT0101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110101000001111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110101000000101011
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
Bytes337 50 2b
Gray code1011001111100000111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110101000000101011
64-bit0000000000000000000000000000000000000000001101110101000000101011
One's complement11111111110010001010111111010100at 32 bits, every bit flipped
Bits reversed11010100000010101110110000000000at 32 bits
Rotated left by 100000000011011101010000001010110at 32 bits, wrapping
Shifted left by 111011101010000001010110= 7,250,006, no wrap
Shifted right by 1110111010100000010101= 1,812,501, discarding the low bit
These bits as a double1.79098945 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,625,003 to the power 213,140,646,750,009
3,625,003 to the power 347,634,883,890,722,875,027
3,625,003 to the power 4172,676,597,008,522,094,141,500,081
3,625,003 to the power 5625,953,182,185,683,616,829,220,218,125,243
First ten multiples3,625,003, 7,250,006, 10,875,009, 14,500,012, 18,125,015, 21,750,018, 25,375,021, 29,000,024, 32,625,027, 36,250,030
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 3
Collatz (3n + 1) trajectory
Steps to reach 1203the total stopping time
Highest value reached16,312,5164× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,625,003 → 10,875,010 → 5,437,505 → 16,312,516 → 8,156,258 → 4,078,129 → 12,234,388 → 6,117,194 → 3,058,597 → 9,175,792 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage362,500,300%
3,625,003% as a decimal36,250.03
3,625,003% of 1003,625,003
3,625,003% of 1,00036,250,030
As a fraction of 1003,625,003/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,003
Nerdulate something else
Nothing in mind? Surprise me · today’s page