Nerdulator> put something in

Recognised as Number

3,146,359

  • Positive
  • Odd
  • Prime
  • 7 digits

3,146,359 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,146,359
Digit count7
Digit sum31
Digit product9,720
Multiplicative persistence2times 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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3,146,359
Distinct prime factors13,146,359
Number of divisors2
Sum of divisors σ(n)3,146,360
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,146,358integers below n that share no factor with it
Carmichael function λ(n)3,146,358the 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,146,3592 in total

Arithmetic

Previous number3,146,358
Next number3,146,360
Double6,292,718
Cube31,147,616,761,757,146,279
Square root1,773.797902806≈irrational, shown to 9 decimal places
Cube root146.533219412≈
Negation-3,146,359
Reciprocal3.17827686 × 10^-7≈

Representations

Decimal3,146,359
Binary110000000000100111011122 bits
Octal14001167
Hexadecimal300277
Base 361VFQV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, one hundred and forty-six thousand, three hundred and fifty-nine
Ordinalthree million, one hundred and forty-six thousand, three hundred and fifty-ninth
Scientific notation3.146359 × 10^6
Engineering notation3.146359 × 10^6

In other bases

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

Bit-level

00000000001100000000001001110111
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
Bytes330 02 77
Gray code1010000000001101001100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001100000000001001110111
64-bit0000000000000000000000000000000000000000001100000000001001110111
One's complement11111111110011111111110110001000at 32 bits, every bit flipped
Bits reversed11101110010000000000110000000000at 32 bits
Rotated left by 100000000011000000000010011101110at 32 bits, wrapping
Shifted left by 111000000000010011101110= 6,292,718, no wrap
Shifted right by 1110000000000100111011= 1,573,179, discarding the low bit
These bits as a double1.55450789 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,146,371+12
Previous prime3,146,327−32
Distance to nearest prime0, it is prime
Nearest square below3,143,529
Nearest square above3,147,076

Powers & multiples

3,146,359 to the power 29,899,574,956,881
3,146,359 to the power 331,147,616,761,757,146,279
3,146,359 to the power 498,001,584,326,905,453,009,248,161
3,146,359 to the power 5308,348,166,861,217,914,224,725,034,595,799
First ten multiples3,146,359, 6,292,718, 9,439,077, 12,585,436, 15,731,795, 18,878,154, 22,024,513, 25,170,872, 28,317,231, 31,463,590
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 1133the total stopping time
Highest value reached21,237,9286× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,146,359 → 9,439,078 → 4,719,539 → 14,158,618 → 7,079,309 → 21,237,928 → 10,618,964 → 5,309,482 → 2,654,741 → 7,964,224 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage314,635,900%
3,146,359% as a decimal31,463.59
3,146,359% of 1003,146,359
3,146,359% of 1,00031,463,590
As a fraction of 1003,146,359/100

Read another way

As bytes3.001 MiB
As a 24-bit colour#300277

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