Recognised as Number
3,314,291
- Positive
- Odd
- Composite
- 7 digits
3,314,291 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,314,291
Digit count7
Digit sum23
Digit product648
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation181 × 18,311
Distinct prime factors2181, 18,311
Number of divisors4
Sum of divisors σ(n)3,332,784
Aliquot sum18,493sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,295,800integers below n that share no factor with it
Carmichael function λ(n)329,580the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,295,800
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 181, 18,311, 3,314,2914 in total
Arithmetic
Previous number3,314,290
Next number3,314,292
Double6,628,582
Half1,657,145.5
Square10,984,524,832,681
Cube36,405,911,792,231,144,171
Square root1,820.519431371≈irrational, shown to 9 decimal places
Cube root149.095160148≈
Negation-3,314,291
Reciprocal3.01723657 × 10^-7≈
Representations
Decimal3,314,291
Binary110010100100100111001122 bits
Octal14511163
Hexadecimal329273
Base 361Z1BN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and fourteen thousand, two hundred and ninety-one
Ordinalthree million, three hundred and fourteen thousand, two hundred and ninety-first
Scientific notation3.314291 × 10^6
Engineering notation3.314291 × 10^6
In other bases
Ternary20020101100112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1322024131base 5; one hand: 10 digits
Septenary40112441base 7: 8 digits
Nonary6211315base 9; each digit is two ternary digits: 7 digits
Duodecimal1139babbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10e5ebbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:20:38:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T0101101TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111001011110110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101001001001110011
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
Bytes332 92 73
Gray code1010111101101101001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101001001001110011
64-bit0000000000000000000000000000000000000000001100101001001001110011
One's complement11111111110011010110110110001100at 32 bits, every bit flipped
Bits reversed11001110010010010100110000000000at 32 bits
Rotated left by 100000000011001010010010011100110at 32 bits, wrapping
Shifted left by 111001010010010011100110= 6,628,582, no wrap
Shifted right by 1110010100100100111001= 1,657,145, discarding the low bit
These bits as a double1.63747732 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,314,291 to the power 210,984,524,832,681
3,314,291 to the power 336,405,911,792,231,144,171
3,314,291 to the power 4120,659,785,799,785,551,045,647,761
3,314,291 to the power 5399,901,642,138,157,053,760,630,963,452,451
First ten multiples3,314,291, 6,628,582, 9,942,873, 13,257,164, 16,571,455, 19,885,746, 23,200,037, 26,514,328, 29,828,619, 33,142,910
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached14,914,3124× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,314,291 → 9,942,874 → 4,971,437 → 14,914,312 → 7,457,156 → 3,728,578 → 1,864,289 → 5,592,868 → 2,796,434 → 1,398,217 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage331,429,100%
3,314,291% as a decimal33,142.91
3,314,291% of 1003,314,291
3,314,291% of 1,00033,142,910
As a fraction of 1003,314,291/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 3,314,291
Nerdulate something else
Nothing in mind? Surprise me · today’s page