Nerdulator> put something in

Recognised as Number

2,753,064

  • Positive
  • Even
  • Composite
  • 7 digits

2,753,064 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,753,064
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 3^2 × 38,237
Distinct prime factors32, 3, 38,237
Number of divisors24
Sum of divisors σ(n)7,456,410
Aliquot sum4,703,346sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)917,664integers below n that share no factor with it
Carmichael function λ(n)114,708the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 917,664
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 38,237, 76,474, 114,711, 152,948, 229,422, 305,896, 344,133, 458,844, 688,266, 917,688, 1,376,532, 2,753,06424 in total

Arithmetic

Previous number2,753,063
Next number2,753,065
Double5,506,128
Cube20,866,466,980,557,126,144
Square root1,659.235968752≈irrational, shown to 9 decimal places
Cube root140.153980241≈
Negation-2,753,064
Reciprocal3.63231658 × 10^-7≈

Representations

Decimal2,753,064
Binary101010000000100010100022 bits
Octal12401050
Hexadecimal2A0228
Base 361N0A0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, seven hundred and fifty-three thousand and sixty-four
Ordinaltwo million, seven hundred and fifty-three thousand and sixty-fourth
Scientific notation2.753064 × 10^6
Engineering notation2.753064 × 10^6

In other bases

Ternary12011212111100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1201044224base 5; one hand: 10 digits
Septenary32254266base 7: 8 digits
Nonary5155440base 9; each digit is two ternary digits: 7 digits
Duodecimalb09260base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalh42d4base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:44:44:24base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1TT0TT111100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111100000011001111000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001010100000001000101000
Bit length22 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits16within that length
Bit parityeven6 set bits, so even; 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
Bytes32a 02 28
Gray code1111110000001100111100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001010100000001000101000
64-bit0000000000000000000000000000000000000000001010100000001000101000
One's complement11111111110101011111110111010111at 32 bits, every bit flipped
Bits reversed00010100010000000101010000000000at 32 bits
Rotated left by 100000000010101000000010001010000at 32 bits, wrapping
Shifted left by 110101000000010001010000= 5,506,128, no wrap
Shifted right by 1101010000000100010100= 1,376,532, discarding the low bit
These bits as a double1.36019434 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,753,111+47
Previous prime2,753,063−1
Distance to nearest prime1
Nearest square below2,752,281
Nearest square above2,755,600

Powers & multiples

2,753,064 to the power 27,579,361,388,096
2,753,064 to the power 320,866,466,980,557,126,144
2,753,064 to the power 457,446,719,051,360,523,930,505,216
2,753,064 to the power 5158,154,494,138,414,809,454,212,411,981,824
First ten multiples2,753,064, 5,506,128, 8,259,192, 11,012,256, 13,765,320, 16,518,384, 19,271,448, 22,024,512, 24,777,576, 27,530,640
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 181the total stopping time
Highest value reached2,753,064
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,753,064 → 1,376,532 → 688,266 → 344,133 → 1,032,400 → 516,200 → 258,100 → 129,050 → 64,525 → 193,576 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage275,306,400%
2,753,064% as a decimal27,530.64
2,753,064% of 1002,753,064
2,753,064% of 1,00027,530,640
As a fraction of 1002,753,064/100

Read another way

As bytes2.626 MiB
As a 24-bit colour#2A0228

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 “2753064” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.