Nerdulator> put something in

Recognised as Number

2,820,135

  • Positive
  • Odd
  • Composite
  • 7 digits

2,820,135 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,820,135
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 229 × 821
Distinct prime factors43, 5, 229, 821
Number of divisors16
Sum of divisors σ(n)4,537,440
Aliquot sum1,717,305sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,495,680integers below n that share no factor with it
Carmichael function λ(n)46,740the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,495,680
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 229, 687, 821, 1,145, 2,463, 3,435, 4,105, 12,315, 188,009, 564,027, 940,045, 2,820,13516 in total

Arithmetic

Previous number2,820,134
Next number2,820,136
Double5,640,270
Cube22,428,988,876,185,960,375
Square root1,679.325757559≈irrational, shown to 9 decimal places
Cube root141.283018882≈
Negation-2,820,135
Reciprocal3.54592954 × 10^-7≈

Representations

Decimal2,820,135
Binary101011000010000010011122 bits
Octal12604047
Hexadecimal2B0827
Base 361OG13
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, eight hundred and twenty thousand, one hundred and thirty-five
Ordinaltwo million, eight hundred and twenty thousand, one hundred and thirty-fifth
Scientific notation2.820135 × 10^6
Engineering notation2.820135 × 10^6

In other bases

Ternary12022021111110base 3; the most digit-efficient integer base after e: 14 digits
Quinary1210221020base 5; one hand: 10 digits
Septenary32653653base 7: 8 digits
Nonary5267443base 9; each digit is two ternary digits: 7 digits
Duodecimalb40033base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalhca6fbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:3:22:15base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT10T1T1111110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111110001100001111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001010110000100000100111
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 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
Bytes32b 08 27
Gray code1111101000110000110100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001010110000100000100111
64-bit0000000000000000000000000000000000000000001010110000100000100111
One's complement11111111110101001111011111011000at 32 bits, every bit flipped
Bits reversed11100100000100001101010000000000at 32 bits
Rotated left by 100000000010101100001000001001110at 32 bits, wrapping
Shifted left by 110101100001000001001110= 5,640,270, no wrap
Shifted right by 1101011000010000010011= 1,410,067, discarding the low bit
These bits as a double1.39333182 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,820,179+44
Previous prime2,820,131−4
Distance to nearest prime4
Nearest square below2,819,041
Nearest square above2,822,400

Powers & multiples

2,820,135 to the power 27,953,161,418,225
2,820,135 to the power 322,428,988,876,185,960,375
2,820,135 to the power 463,252,776,544,342,693,362,150,625
2,820,135 to the power 5178,381,368,979,879,881,544,868,652,834,375
First ten multiples2,820,135, 5,640,270, 8,460,405, 11,280,540, 14,100,675, 16,920,810, 19,740,945, 22,561,080, 25,381,215, 28,201,350
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 5
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 35

Collatz (3n + 1) trajectory

Steps to reach 1213the total stopping time
Highest value reached21,415,4087× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,820,135 → 8,460,406 → 4,230,203 → 12,690,610 → 6,345,305 → 19,035,916 → 9,517,958 → 4,758,979 → 14,276,938 → 7,138,469 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage282,013,500%
2,820,135% as a decimal28,201.35
2,820,135% of 1002,820,135
2,820,135% of 1,00028,201,350
As a fraction of 1002,820,135/100

Read another way

As bytes2.689 MiB
As a 24-bit colour#2B0827

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “2820135” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.