Recognised as Number
3,446,395
- Positive
- Odd
- Composite
- 7 digits
3,446,395 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,446,395
Digit count7
Digit sum34
Digit product38,880
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 689,279
Distinct prime factors25, 689,279
Number of divisors4
Sum of divisors σ(n)4,135,680
Aliquot sum689,285sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,757,112integers below n that share no factor with it
Carmichael function λ(n)1,378,556the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,757,112
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 689,279, 3,446,3954 in total
Arithmetic
Previous number3,446,394
Next number3,446,396
Double6,892,790
Half1,723,197.5
Square11,877,638,496,025
Cube40,935,033,924,508,079,875
Square root1,856.446875082≈irrational, shown to 9 decimal places
Cube root151.05033189≈
Negation-3,446,395
Reciprocal2.90158267 × 10^-7≈
Representations
Decimal3,446,395
Binary110100100101100111101122 bits
Octal15113173
Hexadecimal34967B
Base 3621V97
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and forty-six thousand, three hundred and ninety-five
Ordinalthree million, four hundred and forty-six thousand, three hundred and ninety-fifth
Scientific notation3.446395 × 10^6
Engineering notation3.446395 × 10^6
In other bases
Ternary20111002120021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1340241040base 5; one hand: 10 digits
Septenary41202541base 7: 8 digits
Nonary6432507base 9; each digit is two ternary digits: 7 digits
Duodecimal11a2537base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11afjfbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:57:19:55base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0111010TT01T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101011110101110001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101001001011001111011
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
Bytes334 96 7b
Gray code1011101101110101000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101001001011001111011
64-bit0000000000000000000000000000000000000000001101001001011001111011
One's complement11111111110010110110100110000100at 32 bits, every bit flipped
Bits reversed11011110011010010010110000000000at 32 bits
Rotated left by 100000000011010010010110011110110at 32 bits, wrapping
Shifted left by 111010010010110011110110= 6,892,790, no wrap
Shifted right by 1110100100101100111101= 1,723,197, discarding the low bit
These bits as a double1.70274537 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,446,395 to the power 211,877,638,496,025
3,446,395 to the power 340,935,033,924,508,079,875
3,446,395 to the power 4141,078,296,242,255,023,940,800,625
3,446,395 to the power 5486,211,534,777,826,503,234,455,569,996,875
First ten multiples3,446,395, 6,892,790, 10,339,185, 13,785,580, 17,231,975, 20,678,370, 24,124,765, 27,571,160, 31,017,555, 34,463,950
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 5
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 95
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached17,447,3805× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,446,395 → 10,339,186 → 5,169,593 → 15,508,780 → 7,754,390 → 3,877,195 → 11,631,586 → 5,815,793 → 17,447,380 → 8,723,690 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage344,639,500%
3,446,395% as a decimal34,463.95
3,446,395% of 1003,446,395
3,446,395% of 1,00034,463,950
As a fraction of 1003,446,395/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,446,395
Nerdulate something else
Nothing in mind? Surprise me · today’s page