Recognised as Number
3,622,552
- Positive
- Even
- Composite
- 7 digits
3,622,552 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,622,552
Digit count7
Digit sum25
Digit product3,600
Multiplicative persistence2times 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 factorisation2^3 × 73 × 6,203
Distinct prime factors32, 73, 6,203
Number of divisors16
Sum of divisors σ(n)6,886,440
Aliquot sum3,263,888sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,786,176integers below n that share no factor with it
Carmichael function λ(n)223,272the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,786,176
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 73, 146, 292, 584, 6,203, 12,406, 24,812, 49,624, 452,819, 905,638, 1,811,276, 3,622,55216 in total
Arithmetic
Previous number3,622,551
Next number3,622,553
Double7,245,104
Half1,811,276
Square13,122,882,992,704
Cube47,538,326,030,985,860,608
Square root1,903.300291599≈irrational, shown to 9 decimal places
Cube root153.581254042≈
Negation-3,622,552
Reciprocal2.76048487 × 10^-7≈
Representations
Decimal3,622,552
Binary110111010001101001100022 bits
Octal15643230
Hexadecimal374698
Base 3625N6G
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and twenty-two thousand, five hundred and fifty-two
Ordinalthree million, six hundred and twenty-two thousand, five hundred and fifty-second
Scientific notation3.622552 × 10^6
Engineering notation3.622552 × 10^6
In other bases
Ternary20211001012121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1411410202base 5; one hand: 10 digits
Septenary42535243base 7: 8 digits
Nonary6731177base 9; each digit is two ternary digits: 7 digits
Duodecimal1268474base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12cg7cbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:46:15:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T110011T0TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110101101111101000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110100011010011000
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes337 46 98
Gray code1011001110010111010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110100011010011000
64-bit0000000000000000000000000000000000000000001101110100011010011000
One's complement11111111110010001011100101100111at 32 bits, every bit flipped
Bits reversed00011001011000101110110000000000at 32 bits
Rotated left by 100000000011011101000110100110000at 32 bits, wrapping
Shifted left by 111011101000110100110000= 7,245,104, no wrap
Shifted right by 1110111010001101001100= 1,811,276, discarding the low bit
These bits as a double1.78977849 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,622,552 to the power 213,122,882,992,704
3,622,552 to the power 347,538,326,030,985,860,608
3,622,552 to the power 4172,210,058,040,199,891,317,231,616
3,622,552 to the power 5623,839,890,173,642,196,691,020,025,004,032
First ten multiples3,622,552, 7,245,104, 10,867,656, 14,490,208, 18,112,760, 21,735,312, 25,357,864, 28,980,416, 32,602,968, 36,225,520
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 4
Divisible by 100No, remainder 52
Collatz (3n + 1) trajectory
Steps to reach 1159the total stopping time
Highest value reached3,622,552
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,622,552 → 1,811,276 → 905,638 → 452,819 → 1,358,458 → 679,229 → 2,037,688 → 1,018,844 → 509,422 → 254,711 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage362,255,200%
3,622,552% as a decimal36,225.52
3,622,552% of 1003,622,552
3,622,552% of 1,00036,225,520
As a fraction of 1003,622,552/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,622,552
Nerdulate something else
Nothing in mind? Surprise me · today’s page