Recognised as Number
3,418,861
- Positive
- Odd
- Prime
- 7 digits
3,418,861 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,418,861
Digit count7
Digit sum31
Digit product4,608
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,418,861
Distinct prime factors13,418,861
Number of divisors2
Sum of divisors σ(n)3,418,862
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,418,860integers below n that share no factor with it
Carmichael function λ(n)3,418,860the 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,418,8612 in total
Arithmetic
Previous number3,418,860
Next number3,418,862
Double6,837,722
Half1,709,430.5
Square11,688,610,537,321
Cube39,961,734,710,235,811,381
Square root1,849.016224915≈irrational, shown to 9 decimal places
Cube root150.646997872≈
Negation-3,418,861
Reciprocal2.92495074 × 10^-7≈
Representations
Decimal3,418,861
Binary110100001010101110110122 bits
Octal15025355
Hexadecimal342AED
Base 3621A0D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and eighteen thousand, eight hundred and sixty-one
Ordinalthree million, four hundred and eighteen thousand, eight hundred and sixty-first
Scientific notation3.418861 × 10^6
Engineering notation3.418861 × 10^6
In other bases
Ternary20102200210111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1333400421base 5; one hand: 10 digits
Septenary41026345base 7: 8 digits
Nonary6380714base 9; each digit is two ternary digits: 7 digits
Duodecimal118a611base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal117731base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:49:41:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0110T01T10111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101000111111100111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101000010101011101101
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; 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
Bytes334 2a ed
Gray code1011100011111110011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101000010101011101101
64-bit0000000000000000000000000000000000000000001101000010101011101101
One's complement11111111110010111101010100010010at 32 bits, every bit flipped
Bits reversed10110111010101000010110000000000at 32 bits
Rotated left by 100000000011010000101010111011010at 32 bits, wrapping
Shifted left by 111010000101010111011010= 6,837,722, no wrap
Shifted right by 1110100001010101110110= 1,709,430, discarding the low bit
These bits as a double1.68914177 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,418,861 to the power 211,688,610,537,321
3,418,861 to the power 339,961,734,710,235,811,381
3,418,861 to the power 4136,623,616,293,171,516,333,857,041
3,418,861 to the power 5467,097,153,423,688,663,504,686,817,050,301
First ten multiples3,418,861, 6,837,722, 10,256,583, 13,675,444, 17,094,305, 20,513,166, 23,932,027, 27,350,888, 30,769,749, 34,188,610
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 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1177the total stopping time
Highest value reached10,256,5843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,418,861 → 10,256,584 → 5,128,292 → 2,564,146 → 1,282,073 → 3,846,220 → 1,923,110 → 961,555 → 2,884,666 → 1,442,333 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage341,886,100%
3,418,861% as a decimal34,188.61
3,418,861% of 1003,418,861
3,418,861% of 1,00034,188,610
As a fraction of 1003,418,861/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,418,861
Nerdulate something else
Nothing in mind? Surprise me · today’s page