Recognised as Number
3,381,251
- Positive
- Odd
- Prime
- 7 digits
3,381,251 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,381,251
Digit count7
Digit sum23
Digit product720
Multiplicative persistence2times 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 factorisation3,381,251
Distinct prime factors13,381,251
Number of divisors2
Sum of divisors σ(n)3,381,252
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,381,250integers below n that share no factor with it
Carmichael function λ(n)3,381,250the 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,381,2512 in total
Arithmetic
Previous number3,381,250
Next number3,381,252
Double6,762,502
Half1,690,625.5
Square11,432,858,325,001
Cube38,657,363,644,267,956,251
Square root1,838.817826757≈irrational, shown to 9 decimal places
Cube root150.092550292≈
Negation-3,381,251
Reciprocal2.95748526 × 10^-7≈
Representations
Decimal3,381,251
Binary110011100110000000001122 bits
Octal14714003
Hexadecimal339803
Base 3620GZN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and eighty-one thousand, two hundred and fifty-one
Ordinalthree million, three hundred and eighty-one thousand, two hundred and fifty-first
Scientific notation3.381251 × 10^6
Engineering notation3.381251 × 10^6
In other bases
Ternary20100210012112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331200001base 5; one hand: 10 digits
Septenary40511606base 7: 8 digits
Nonary6323175base 9; each digit is two ternary digits: 7 digits
Duodecimal11708abbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal112d2bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:39:14:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101T101T0TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001110100000000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111001100000000011
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
Bytes333 98 03
Gray code1010100101010000000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111001100000000011
64-bit0000000000000000000000000000000000000000001100111001100000000011
One's complement11111111110011000110011111111100at 32 bits, every bit flipped
Bits reversed11000000000110011100110000000000at 32 bits
Rotated left by 100000000011001110011000000000110at 32 bits, wrapping
Shifted left by 111001110011000000000110= 6,762,502, no wrap
Shifted right by 1110011100110000000001= 1,690,625, discarding the low bit
These bits as a double1.67055996 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,381,251 to the power 211,432,858,325,001
3,381,251 to the power 338,657,363,644,267,956,251
3,381,251 to the power 4130,710,249,479,544,671,341,650,001
3,381,251 to the power 5441,964,161,762,959,899,518,625,407,531,251
First ten multiples3,381,251, 6,762,502, 10,143,753, 13,525,004, 16,906,255, 20,287,506, 23,668,757, 27,050,008, 30,431,259, 33,812,510
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 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 51
Collatz (3n + 1) trajectory
Steps to reach 184the total stopping time
Highest value reached15,215,6324× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,381,251 → 10,143,754 → 5,071,877 → 15,215,632 → 7,607,816 → 3,803,908 → 1,901,954 → 950,977 → 2,852,932 → 1,426,466 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage338,125,100%
3,381,251% as a decimal33,812.51
3,381,251% of 1003,381,251
3,381,251% of 1,00033,812,510
As a fraction of 1003,381,251/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,381,251
Nerdulate something else
Nothing in mind? Surprise me · today’s page