Recognised as Number
3,484,981
- Positive
- Odd
- Composite
- 7 digits
3,484,981 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,484,981
Digit count7
Digit sum37
Digit product27,648
Multiplicative persistence7times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation233 × 14,957
Distinct prime factors2233, 14,957
Number of divisors4
Sum of divisors σ(n)3,500,172
Aliquot sum15,191sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,469,792integers below n that share no factor with it
Carmichael function λ(n)867,448the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,469,792
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 233, 14,957, 3,484,9814 in total
Arithmetic
Previous number3,484,980
Next number3,484,982
Double6,969,962
Half1,742,490.5
Square12,145,092,570,361
Cube42,325,416,850,949,248,141
Square root1,866.810381372≈irrational, shown to 9 decimal places
Cube root151.611963258≈
Negation-3,484,981
Reciprocal2.8694561 × 10^-7≈
Representations
Decimal3,484,981
Binary110101001011010011010122 bits
Octal15226465
Hexadecimal352D35
Base 3622P11
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and eighty-four thousand, nine hundred and eighty-one
Ordinalthree million, four hundred and eighty-four thousand, nine hundred and eighty-first
Scientific notation3.484981 × 10^6
Engineering notation3.484981 × 10^6
In other bases
Ternary20120001111101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1343004411base 5; one hand: 10 digits
Septenary41423203base 7: 8 digits
Nonary6501441base 9; each digit is two ternary digits: 7 digits
Duodecimal1200931base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11fc91base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:8:3:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT0001111101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010111110101110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010010110100110101
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
Bytes335 2d 35
Gray code1011111011101110101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010010110100110101
64-bit0000000000000000000000000000000000000000001101010010110100110101
One's complement11111111110010101101001011001010at 32 bits, every bit flipped
Bits reversed10101100101101001010110000000000at 32 bits
Rotated left by 100000000011010100101101001101010at 32 bits, wrapping
Shifted left by 111010100101101001101010= 6,969,962, no wrap
Shifted right by 1110101001011010011010= 1,742,490, discarding the low bit
These bits as a double1.72180939 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,484,981 to the power 212,145,092,570,361
3,484,981 to the power 342,325,416,850,949,248,141
3,484,981 to the power 4147,503,273,542,637,961,735,670,321
3,484,981 to the power 5514,046,105,733,895,986,527,538,090,948,901
First ten multiples3,484,981, 6,969,962, 10,454,943, 13,939,924, 17,424,905, 20,909,886, 24,394,867, 27,879,848, 31,364,829, 34,849,810
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 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Highest value reached10,454,9443× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,484,981 → 10,454,944 → 5,227,472 → 2,613,736 → 1,306,868 → 653,434 → 326,717 → 980,152 → 490,076 → 245,038 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage348,498,100%
3,484,981% as a decimal34,849.81
3,484,981% of 1003,484,981
3,484,981% of 1,00034,849,810
As a fraction of 1003,484,981/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,484,981
Nerdulate something else
Nothing in mind? Surprise me · today’s page