Nerdulator> put something in

Recognised as Number

3,090,781

  • Positive
  • Odd
  • Prime
  • 7 digits

3,090,781 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

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

Factors & divisors

Prime factorisation3,090,781
Distinct prime factors13,090,781
Number of divisors2
Sum of divisors σ(n)3,090,782
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,090,780integers below n that share no factor with it
Carmichael function λ(n)3,090,780the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3,090,7812 in total

Arithmetic

Previous number3,090,780
Next number3,090,782
Double6,181,562
Cube29,526,005,853,114,849,541
Square root1,758.061716778≈irrational, shown to 9 decimal places
Cube root145.665290049≈
Negation-3,090,781
Reciprocal3.2354282 × 10^-7≈

Representations

Decimal3,090,781
Binary101111001010010101110122 bits
Octal13624535
Hexadecimal2F295D
Base 361U8V1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, ninety thousand, seven hundred and eighty-one
Ordinalthree million, ninety thousand, seven hundred and eighty-first
Scientific notation3.090781 × 10^6
Engineering notation3.090781 × 10^6

In other bases

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

Bit-level

00000000001011110010100101011101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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 29 5d
Gray code1110001011110111110011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001011110010100101011101
64-bit0000000000000000000000000000000000000000001011110010100101011101
One's complement11111111110100001101011010100010at 32 bits, every bit flipped
Bits reversed10111010100101001111010000000000at 32 bits
Rotated left by 100000000010111100101001010111010at 32 bits, wrapping
Shifted left by 110111100101001010111010= 6,181,562, no wrap
Shifted right by 1101111001010010101110= 1,545,390, discarding the low bit
These bits as a double1.52704871 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,090,817+36
Previous prime3,090,779−2
Distance to nearest prime0, it is prime
Nearest square below3,090,564
Nearest square above3,094,081

Powers & multiples

3,090,781 to the power 29,552,927,189,961
3,090,781 to the power 329,526,005,853,114,849,541
3,090,781 to the power 491,258,417,896,696,167,779,181,521
3,090,781 to the power 5282,059,784,125,168,478,144,706,440,657,901
First ten multiples3,090,781, 6,181,562, 9,272,343, 12,363,124, 15,453,905, 18,544,686, 21,635,467, 24,726,248, 27,817,029, 30,907,810
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 150the total stopping time
Highest value reached9,272,3443× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,090,781 → 9,272,344 → 4,636,172 → 2,318,086 → 1,159,043 → 3,477,130 → 1,738,565 → 5,215,696 → 2,607,848 → 1,303,924 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage309,078,100%
3,090,781% as a decimal30,907.81
3,090,781% of 1003,090,781
3,090,781% of 1,00030,907,810
As a fraction of 1003,090,781/100

Read another way

As bytes2.948 MiB
As a 24-bit colour#2F295D

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