Recognised as Number
3,398,731
- Positive
- Odd
- Composite
- 7 digits
3,398,731 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,398,731
Digit count7
Digit sum34
Digit product13,608
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 53 × 9,161
Distinct prime factors37, 53, 9,161
Number of divisors8
Sum of divisors σ(n)3,957,984
Aliquot sum559,253sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,857,920integers below n that share no factor with it
Carmichael function λ(n)357,240the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,857,920
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 53, 371, 9,161, 64,127, 485,533, 3,398,7318 in total
Arithmetic
Previous number3,398,730
Next number3,398,732
Double6,797,462
Half1,699,365.5
Square11,551,372,410,361
Cube39,260,007,503,638,651,891
Square root1,843.564753406≈irrational, shown to 9 decimal places
Cube root150.350749563≈
Negation-3,398,731
Reciprocal2.94227463 × 10^-7≈
Representations
Decimal3,398,731
Binary110011110111000100101122 bits
Octal14756113
Hexadecimal33DC4B
Base 3620UH7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and ninety-eight thousand, seven hundred and thirty-one
Ordinalthree million, three hundred and ninety-eight thousand, seven hundred and thirty-first
Scientific notation3.398731 × 10^6
Engineering notation3.398731 × 10^6
In other bases
Ternary20101200011221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1332224411base 5; one hand: 10 digits
Septenary40613560base 7: 8 digits
Nonary6350157base 9; each digit is two ternary digits: 7 digits
Duodecimal117aa37base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal114ggbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:44:5:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011TT001TT0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101000010110001011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111101110001001011
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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 dc 4b
Gray code1010100011001001101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111101110001001011
64-bit0000000000000000000000000000000000000000001100111101110001001011
One's complement11111111110011000010001110110100at 32 bits, every bit flipped
Bits reversed11010010001110111100110000000000at 32 bits
Rotated left by 100000000011001111011100010010110at 32 bits, wrapping
Shifted left by 111001111011100010010110= 6,797,462, no wrap
Shifted right by 1110011110111000100101= 1,699,365, discarding the low bit
These bits as a double1.67919623 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,398,731 to the power 211,551,372,410,361
3,398,731 to the power 339,260,007,503,638,651,891
3,398,731 to the power 4133,434,204,562,849,298,980,150,321
3,398,731 to the power 5453,506,967,508,097,360,772,105,280,642,651
First ten multiples3,398,731, 6,797,462, 10,196,193, 13,594,924, 16,993,655, 20,392,386, 23,791,117, 27,189,848, 30,588,579, 33,987,310
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1177the total stopping time
Highest value reached15,294,2924× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,398,731 → 10,196,194 → 5,098,097 → 15,294,292 → 7,647,146 → 3,823,573 → 11,470,720 → 5,735,360 → 2,867,680 → 1,433,840 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage339,873,100%
3,398,731% as a decimal33,987.31
3,398,731% of 1003,398,731
3,398,731% of 1,00033,987,310
As a fraction of 1003,398,731/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,398,731
Nerdulate something else
Nothing in mind? Surprise me · today’s page