Recognised as Number
3,454,789
- Positive
- Odd
- Composite
- 7 digits
3,454,789 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,454,789
Digit count7
Digit sum40
Digit product120,960
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation13 × 19 × 71 × 197
Distinct prime factors413, 19, 71, 197
Number of divisors16
Sum of divisors σ(n)3,991,680
Aliquot sum536,891sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,963,520integers below n that share no factor with it
Carmichael function λ(n)8,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,963,520
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 19, 71, 197, 247, 923, 1,349, 2,561, 3,743, 13,987, 17,537, 48,659, 181,831, 265,753, 3,454,78916 in total
Arithmetic
Previous number3,454,788
Next number3,454,790
Double6,909,578
Half1,727,394.5
Square11,935,567,034,521
Cube41,234,865,699,625,771,069
Square root1,858.706270501≈irrational, shown to 9 decimal places
Cube root151.172864614≈
Negation-3,454,789
Reciprocal2.89453278 × 10^-7≈
Representations
Decimal3,454,789
Binary110100101101110100010122 bits
Octal15133505
Hexadecimal34B745
Base 36221QD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and fifty-four thousand, seven hundred and eighty-nine
Ordinalthree million, four hundred and fifty-four thousand, seven hundred and eighty-ninth
Scientific notation3.454789 × 10^6
Engineering notation3.454789 × 10^6
In other bases
Ternary20111112002011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1341023124base 5; one hand: 10 digits
Septenary41236162base 7: 8 digits
Nonary6445064base 9; each digit is two ternary digits: 7 digits
Duodecimal11a7371base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11bgj9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:59:39:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TTTTTT01T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101011100101101000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101001011011101000101
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
Bytes334 b7 45
Gray code1011101110110011100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101001011011101000101
64-bit0000000000000000000000000000000000000000001101001011011101000101
One's complement11111111110010110100100010111010at 32 bits, every bit flipped
Bits reversed10100010111011010010110000000000at 32 bits
Rotated left by 100000000011010010110111010001010at 32 bits, wrapping
Shifted left by 111010010110111010001010= 6,909,578, no wrap
Shifted right by 1110100101101110100010= 1,727,394, discarding the low bit
These bits as a double1.70689256 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,454,789 to the power 211,935,567,034,521
3,454,789 to the power 341,234,865,699,625,771,069
3,454,789 to the power 4142,457,760,435,544,418,005,699,441
3,454,789 to the power 5492,161,503,717,354,064,337,492,366,072,949
First ten multiples3,454,789, 6,909,578, 10,364,367, 13,819,156, 17,273,945, 20,728,734, 24,183,523, 27,638,312, 31,093,101, 34,547,890
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 184the total stopping time
Highest value reached10,364,3683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,454,789 → 10,364,368 → 5,182,184 → 2,591,092 → 1,295,546 → 647,773 → 1,943,320 → 971,660 → 485,830 → 242,915 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage345,478,900%
3,454,789% as a decimal34,547.89
3,454,789% of 1003,454,789
3,454,789% of 1,00034,547,890
As a fraction of 1003,454,789/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,454,789
Nerdulate something else
Nothing in mind? Surprise me · today’s page