Recognised as Number
3,628,355
- Positive
- Odd
- Composite
- 7 digits
3,628,355 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,628,355
Digit count7
Digit sum32
Digit product21,600
Multiplicative persistence2times 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 factorisation5 × 725,671
Distinct prime factors25, 725,671
Number of divisors4
Sum of divisors σ(n)4,354,032
Aliquot sum725,677sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,902,680integers below n that share no factor with it
Carmichael function λ(n)1,451,340the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,902,680
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 725,671, 3,628,3554 in total
Arithmetic
Previous number3,628,354
Next number3,628,356
Double7,256,710
Half1,814,177.5
Square13,164,960,006,025
Cube47,767,148,462,660,838,875
Square root1,904.824138864≈irrational, shown to 9 decimal places
Cube root153.663218041≈
Negation-3,628,355
Reciprocal2.7560699 × 10^-7≈
Representations
Decimal3,628,355
Binary110111010111010100001122 bits
Octal15656503
Hexadecimal375D43
Base 3625RNN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and twenty-eight thousand, three hundred and fifty-five
Ordinalthree million, six hundred and twenty-eight thousand, three hundred and fifty-fifth
Scientific notation3.628355 × 10^6
Engineering notation3.628355 × 10^6
In other bases
Ternary20211100011112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1412101410base 5; one hand: 10 digits
Septenary42561203base 7: 8 digits
Nonary6740145base 9; each digit is two ternary digits: 7 digits
Duodecimal126b8abbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12dahfbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:47:52:35base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T111001TTTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010001010110101000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110101110101000011
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 5d 43
Gray code1011001111001111100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110101110101000011
64-bit0000000000000000000000000000000000000000001101110101110101000011
One's complement11111111110010001010001010111100at 32 bits, every bit flipped
Bits reversed11000010101110101110110000000000at 32 bits
Rotated left by 100000000011011101011101010000110at 32 bits, wrapping
Shifted left by 111011101011101010000110= 7,256,710, no wrap
Shifted right by 1110111010111010100001= 1,814,177, discarding the low bit
These bits as a double1.79264556 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,628,355 to the power 213,164,960,006,025
3,628,355 to the power 347,767,148,462,660,838,875
3,628,355 to the power 4173,316,171,960,237,768,036,300,625
3,628,355 to the power 5628,852,599,112,788,506,843,351,554,221,875
First ten multiples3,628,355, 7,256,710, 10,885,065, 14,513,420, 18,141,775, 21,770,130, 25,398,485, 29,026,840, 32,655,195, 36,283,550
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 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 5
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 55
Collatz (3n + 1) trajectory
Steps to reach 1128the total stopping time
Highest value reached16,327,6004× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,628,355 → 10,885,066 → 5,442,533 → 16,327,600 → 8,163,800 → 4,081,900 → 2,040,950 → 1,020,475 → 3,061,426 → 1,530,713 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage362,835,500%
3,628,355% as a decimal36,283.55
3,628,355% of 1003,628,355
3,628,355% of 1,00036,283,550
As a fraction of 1003,628,355/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,628,355
Nerdulate something else
Nothing in mind? Surprise me · today’s page