Nerdulator> put something in

Recognised as Number

3,089,121

  • Positive
  • Odd
  • Composite
  • 7 digits

3,089,121 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 6.

Number properties

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

Factors & divisors

Prime factorisation3 × 7 × 17^2 × 509
Distinct prime factors43, 7, 17, 509
Number of divisors24
Sum of divisors σ(n)5,010,240
Aliquot sum1,921,119sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,658,112integers below n that share no factor with it
Carmichael function λ(n)103,632the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,658,112
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 17, 21, 51, 119, 289, 357, 509, 867, 1,527, 2,023, 3,563, 6,069, 8,653, 10,689, 25,959, 60,571, 147,101, 181,713, 441,303, 1,029,707, 3,089,12124 in total

Arithmetic

Previous number3,089,120
Next number3,089,122
Double6,178,242
Cube29,478,457,822,002,918,561
Square root1,757.589542527≈irrational, shown to 9 decimal places
Cube root145.639207355≈
Negation-3,089,121
Reciprocal3.23716682 × 10^-7≈

Representations

Decimal3,089,121
Binary101111001000101110000122 bits
Octal13621341
Hexadecimal2F22E1
Base 361U7KX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, eighty-nine thousand, one hundred and twenty-one
Ordinalthree million, eighty-nine thousand, one hundred and twenty-first
Scientific notation3.089121 × 10^6
Engineering notation3.089121 × 10^6

In other bases

Ternary12210221110220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1242322441base 5; one hand: 10 digits
Septenary35154120base 7: 8 digits
Nonary5727426base 9; each digit is two ternary digits: 7 digits
Duodecimal104b829base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalj62g1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:18:5:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T110T11110T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100110110011100100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001011110010001011100001
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes32f 22 e1
Gray code1110001011001110010001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001011110010001011100001
64-bit0000000000000000000000000000000000000000001011110010001011100001
One's complement11111111110100001101110100011110at 32 bits, every bit flipped
Bits reversed10000111010001001111010000000000at 32 bits
Rotated left by 100000000010111100100010111000010at 32 bits, wrapping
Shifted left by 110111100100010111000010= 6,178,242, no wrap
Shifted right by 1101111001000101110000= 1,544,560, discarding the low bit
These bits as a double1.52622856 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,089,123+2
Previous prime3,089,117−4
Distance to nearest prime2
Nearest square below3,087,049
Nearest square above3,090,564

Powers & multiples

3,089,121 to the power 29,542,668,552,641
3,089,121 to the power 329,478,457,822,002,918,561
3,089,121 to the power 491,062,523,105,563,477,788,074,881
3,089,121 to the power 5281,303,152,438,381,356,068,175,664,469,601
First ten multiples3,089,121, 6,178,242, 9,267,363, 12,356,484, 15,445,605, 18,534,726, 21,623,847, 24,712,968, 27,802,089, 30,891,210
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21

Collatz (3n + 1) trajectory

Steps to reach 1226the total stopping time
Highest value reached29,689,0729× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,089,121 → 9,267,364 → 4,633,682 → 2,316,841 → 6,950,524 → 3,475,262 → 1,737,631 → 5,212,894 → 2,606,447 → 7,819,342 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage308,912,100%
3,089,121% as a decimal30,891.21
3,089,121% of 1003,089,121
3,089,121% of 1,00030,891,210
As a fraction of 1003,089,121/100

Read another way

As bytes2.946 MiB
As a 24-bit colour#2F22E1

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