Recognised as Number
3,481,377
- Positive
- Odd
- Composite
- 7 digits
3,481,377 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,481,377
Digit count7
Digit sum33
Digit product14,112
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 1,160,459
Distinct prime factors23, 1,160,459
Number of divisors4
Sum of divisors σ(n)4,641,840
Aliquot sum1,160,463sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,320,916integers below n that share no factor with it
Carmichael function λ(n)1,160,458the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,320,916
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 1,160,459, 3,481,3774 in total
Arithmetic
Previous number3,481,376
Next number3,481,378
Double6,962,754
Half1,740,688.5
Square12,119,985,816,129
Cube42,194,239,860,597,729,633
Square root1,865.844848855≈irrational, shown to 9 decimal places
Cube root151.559681961≈
Negation-3,481,377
Reciprocal2.87242663 × 10^-7≈
Representations
Decimal3,481,377
Binary110101000111110010000122 bits
Octal15217441
Hexadecimal351F21
Base 3622M8X
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and eighty-one thousand, three hundred and seventy-seven
Ordinalthree million, four hundred and eighty-one thousand, three hundred and seventy-seventh
Scientific notation3.481377 × 10^6
Engineering notation3.481377 × 10^6
In other bases
Ternary20112212112220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1342401002base 5; one hand: 10 digits
Septenary41406534base 7: 8 digits
Nonary6485486base 9; each digit is two ternary digits: 7 digits
Duodecimal11ba829base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11f38hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:7:2:57base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT00T0TT00T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010110001101100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010001111100100001
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
Bytes335 1f 21
Gray code1011111001000010110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010001111100100001
64-bit0000000000000000000000000000000000000000001101010001111100100001
One's complement11111111110010101110000011011110at 32 bits, every bit flipped
Bits reversed10000100111110001010110000000000at 32 bits
Rotated left by 100000000011010100011111001000010at 32 bits, wrapping
Shifted left by 111010100011111001000010= 6,962,754, no wrap
Shifted right by 1110101000111110010000= 1,740,688, discarding the low bit
These bits as a double1.72002878 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,481,377 to the power 212,119,985,816,129
3,481,377 to the power 342,194,239,860,597,729,633
3,481,377 to the power 4146,894,056,183,168,142,196,544,641
3,481,377 to the power 5511,393,588,632,789,357,375,779,992,650,657
First ten multiples3,481,377, 6,962,754, 10,444,131, 13,925,508, 17,406,885, 20,888,262, 24,369,639, 27,851,016, 31,332,393, 34,813,770
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Highest value reached10,444,1323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,481,377 → 10,444,132 → 5,222,066 → 2,611,033 → 7,833,100 → 3,916,550 → 1,958,275 → 5,874,826 → 2,937,413 → 8,812,240 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage348,137,700%
3,481,377% as a decimal34,813.77
3,481,377% of 1003,481,377
3,481,377% of 1,00034,813,770
As a fraction of 1003,481,377/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,481,377
Nerdulate something else
Nothing in mind? Surprise me · today’s page