Recognised as Number
3,461,996
- Positive
- Even
- Composite
- 7 digits
3,461,996 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,461,996
Digit count7
Digit sum38
Digit product34,992
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 865,499
Distinct prime factors22, 865,499
Number of divisors6
Sum of divisors σ(n)6,058,500
Aliquot sum2,596,504sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,730,996integers below n that share no factor with it
Carmichael function λ(n)865,498the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,730,996
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 865,499, 1,730,998, 3,461,9966 in total
Arithmetic
Previous number3,461,995
Next number3,461,997
Double6,923,992
Half1,730,998
Square11,985,416,304,016
Cube41,493,463,302,838,175,936
Square root1,860.643974542≈irrational, shown to 9 decimal places
Cube root151.277911658≈
Negation-3,461,996
Reciprocal2.88850709 × 10^-7≈
Representations
Decimal3,461,996
Binary110100110100110110110022 bits
Octal15151554
Hexadecimal34D36C
Base 36227AK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and sixty-one thousand, nine hundred and ninety-six
Ordinalthree million, four hundred and sixty-one thousand, nine hundred and ninety-sixth
Scientific notation3.461996 × 10^6
Engineering notation3.461996 × 10^6
In other bases
Ternary20111212222002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1341240441base 5; one hand: 10 digits
Septenary41266166base 7: 8 digits
Nonary6455862base 9; each digit is two ternary digits: 7 digits
Duodecimal11ab578base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11cejgbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:1:39:56base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TTT0T000T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101011101010010111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101001101001101101100
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes334 d3 6c
Gray code1011101011101011011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101001101001101101100
64-bit0000000000000000000000000000000000000000001101001101001101101100
One's complement11111111110010110010110010010011at 32 bits, every bit flipped
Bits reversed00110110110010110010110000000000at 32 bits
Rotated left by 100000000011010011010011011011000at 32 bits, wrapping
Shifted left by 111010011010011011011000= 6,923,992, no wrap
Shifted right by 1110100110100110110110= 1,730,998, discarding the low bit
These bits as a double1.71045329 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,461,996 to the power 211,985,416,304,016
3,461,996 to the power 341,493,463,302,838,175,936
3,461,996 to the power 4143,650,203,980,572,553,737,728,256
3,461,996 to the power 5497,316,431,579,926,258,749,800,271,358,976
First ten multiples3,461,996, 6,923,992, 10,385,988, 13,847,984, 17,309,980, 20,771,976, 24,233,972, 27,695,968, 31,157,964, 34,619,960
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 6
Divisible by 11No, remainder 10
Divisible by 12No, remainder 8
Divisible by 100No, remainder 96
Collatz (3n + 1) trajectory
Steps to reach 171the total stopping time
Highest value reached6,572,3921× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,461,996 → 1,730,998 → 865,499 → 2,596,498 → 1,298,249 → 3,894,748 → 1,947,374 → 973,687 → 2,921,062 → 1,460,531 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage346,199,600%
3,461,996% as a decimal34,619.96
3,461,996% of 1003,461,996
3,461,996% of 1,00034,619,960
As a fraction of 1003,461,996/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,461,996
Nerdulate something else
Nothing in mind? Surprise me · today’s page