Recognised as Number
3,408,907
- Positive
- Odd
- Composite
- 7 digits
3,408,907 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,408,907
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation53 × 64,319
Distinct prime factors253, 64,319
Number of divisors4
Sum of divisors σ(n)3,473,280
Aliquot sum64,373sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,344,536integers below n that share no factor with it
Carmichael function λ(n)1,672,268the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,344,536
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 53, 64,319, 3,408,9074 in total
Arithmetic
Previous number3,408,906
Next number3,408,908
Double6,817,814
Half1,704,453.5
Square11,620,646,934,649
Cube39,613,704,680,053,518,643
Square root1,846.322561201≈irrational, shown to 9 decimal places
Cube root150.500653044≈
Negation-3,408,907
Reciprocal2.93349159 × 10^-7≈
Representations
Decimal3,408,907
Binary110100000001000000101122 bits
Octal15002013
Hexadecimal34040B
Base 36212BV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and eight thousand, nine hundred and seven
Ordinalthree million, four hundred and eight thousand, nine hundred and seventh
Scientific notation3.408907 × 10^6
Engineering notation3.408907 × 10^6
In other bases
Ternary20102012010211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1333041112base 5; one hand: 10 digits
Septenary40655335base 7: 8 digits
Nonary6365124base 9; each digit is two ternary digits: 7 digits
Duodecimal11848b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal116257base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:46:55:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011T1TT011T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101000000010000011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101000000010000001011
Bit length22 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits15within that length
Bit parityodd7 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
Bytes334 04 0b
Gray code1011100000011000001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101000000010000001011
64-bit0000000000000000000000000000000000000000001101000000010000001011
One's complement11111111110010111111101111110100at 32 bits, every bit flipped
Bits reversed11010000001000000010110000000000at 32 bits
Rotated left by 100000000011010000000100000010110at 32 bits, wrapping
Shifted left by 111010000000100000010110= 6,817,814, no wrap
Shifted right by 1110100000001000000101= 1,704,453, discarding the low bit
These bits as a double1.68422384 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,408,907 to the power 211,620,646,934,649
3,408,907 to the power 339,613,704,680,053,518,643
3,408,907 to the power 4135,039,435,179,767,200,076,753,201
3,408,907 to the power 5460,336,875,860,354,666,712,044,524,161,307
First ten multiples3,408,907, 6,817,814, 10,226,721, 13,635,628, 17,044,535, 20,453,442, 23,862,349, 27,271,256, 30,680,163, 34,089,070
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1221the total stopping time
Highest value reached15,340,0844× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,408,907 → 10,226,722 → 5,113,361 → 15,340,084 → 7,670,042 → 3,835,021 → 11,505,064 → 5,752,532 → 2,876,266 → 1,438,133 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage340,890,700%
3,408,907% as a decimal34,089.07
3,408,907% of 1003,408,907
3,408,907% of 1,00034,089,070
As a fraction of 1003,408,907/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,408,907
Nerdulate something else
Nothing in mind? Surprise me · today’s page