Recognised as Number
3,018,532
- Positive
- Even
- Composite
- 7 digits
3,018,532 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,018,532
Digit count7
Digit sum22
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 numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 11 × 31 × 2,213
Distinct prime factors42, 11, 31, 2,213
Number of divisors24
Sum of divisors σ(n)5,951,232
Aliquot sum2,932,700sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,327,200integers below n that share no factor with it
Carmichael function λ(n)33,180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,327,200
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 11, 22, 31, 44, 62, 124, 341, 682, 1,364, 2,213, 4,426, 8,852, 24,343, 48,686, 68,603, 97,372, 137,206, 274,412, 754,633, 1,509,266, 3,018,53224 in total
Arithmetic
Previous number3,018,531
Next number3,018,533
Double6,037,064
Half1,509,266
Square9,111,535,435,024
Cube27,503,461,279,753,864,768
Square root1,737.39229882≈irrational, shown to 9 decimal places
Cube root144.521322827≈
Negation-3,018,532
Reciprocal3.31286864 × 10^-7≈
Representations
Decimal3,018,532
Binary101110000011110010010022 bits
Octal13407444
Hexadecimal2E0F24
Base 361SP44
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, eighteen thousand, five hundred and thirty-two
Ordinalthree million, eighteen thousand, five hundred and thirty-second
Scientific notation3.018532 × 10^6
Engineering notation3.018532 × 10^6
In other bases
Ternary12200100122111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1233043112base 5; one hand: 10 digits
Septenary34441246base 7: 8 digits
Nonary5610574base 9; each digit is two ternary digits: 7 digits
Duodecimal1016a04base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalih66cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:58:28:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00101T0T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100100001001101100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011100000111100100100
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes32e 0f 24
Gray code1110010000100010110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011100000111100100100
64-bit0000000000000000000000000000000000000000001011100000111100100100
One's complement11111111110100011111000011011011at 32 bits, every bit flipped
Bits reversed00100100111100000111010000000000at 32 bits
Rotated left by 100000000010111000001111001001000at 32 bits, wrapping
Shifted left by 110111000001111001001000= 6,037,064, no wrap
Shifted right by 1101110000011110010010= 1,509,266, discarding the low bit
These bits as a double1.49135296 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,018,532 to the power 29,111,535,435,024
3,018,532 to the power 327,503,461,279,753,864,768
3,018,532 to the power 483,020,077,983,697,992,925,880,576
3,018,532 to the power 5250,598,762,036,287,869,982,544,146,834,432
First ten multiples3,018,532, 6,037,064, 9,055,596, 12,074,128, 15,092,660, 18,111,192, 21,129,724, 24,148,256, 27,166,788, 30,185,320
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 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11Yes
Divisible by 12No, remainder 4
Divisible by 100No, remainder 32
Collatz (3n + 1) trajectory
Steps to reach 1257the total stopping time
Highest value reached6,810,1362× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,018,532 → 1,509,266 → 754,633 → 2,263,900 → 1,131,950 → 565,975 → 1,697,926 → 848,963 → 2,546,890 → 1,273,445 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage301,853,200%
3,018,532% as a decimal30,185.32
3,018,532% of 1003,018,532
3,018,532% of 1,00030,185,320
As a fraction of 1003,018,532/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,018,532
Nerdulate something else
Nothing in mind? Surprise me · today’s page