Recognised as Number
3,455,380
- Positive
- Even
- Composite
- 7 digits
3,455,380 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,455,380
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 5 × 197 × 877
Distinct prime factors42, 5, 197, 877
Number of divisors24
Sum of divisors σ(n)7,301,448
Aliquot sum3,846,068sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,373,568integers below n that share no factor with it
Carmichael function λ(n)42,924the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,373,568
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 20, 197, 394, 788, 877, 985, 1,754, 1,970, 3,508, 3,940, 4,385, 8,770, 17,540, 172,769, 345,538, 691,076, 863,845, 1,727,690, 3,455,38024 in total
Arithmetic
Previous number3,455,379
Next number3,455,381
Double6,910,760
Half1,727,690
Square11,939,650,944,400
Cube41,256,031,080,260,872,000
Square root1,858.86524525≈irrational, shown to 9 decimal places
Cube root151.181484347≈
Negation-3,455,380
Reciprocal2.8940377 × 10^-7≈
Representations
Decimal3,455,380
Binary110100101110011001010022 bits
Octal15134624
Hexadecimal34B994
Base 362226S
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and fifty-five thousand, three hundred and eighty
Ordinalthree million, four hundred and fifty-five thousand, three hundred and eightieth
Scientific notation3.45538 × 10^6
Engineering notation3.45538 × 10^6
In other bases
Ternary20111112220001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1341033010base 5; one hand: 10 digits
Septenary41240665base 7: 8 digits
Nonary6445801base 9; each digit is two ternary digits: 7 digits
Duodecimal11a7784base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11bi90base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:59:49:40base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TTTTT00T0001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101011100111010010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101001011100110010100
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes334 b9 94
Gray code1011101110010101011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101001011100110010100
64-bit0000000000000000000000000000000000000000001101001011100110010100
One's complement11111111110010110100011001101011at 32 bits, every bit flipped
Bits reversed00101001100111010010110000000000at 32 bits
Rotated left by 100000000011010010111001100101000at 32 bits, wrapping
Shifted left by 111010010111001100101000= 6,910,760, no wrap
Shifted right by 1110100101110011001010= 1,727,690, discarding the low bit
These bits as a double1.70718455 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,455,380 to the power 211,939,650,944,400
3,455,380 to the power 341,256,031,080,260,872,000
3,455,380 to the power 4142,555,264,674,111,811,891,360,000
3,455,380 to the power 5492,582,610,449,632,472,573,167,516,800,000
First ten multiples3,455,380, 6,910,760, 10,366,140, 13,821,520, 17,276,900, 20,732,280, 24,187,660, 27,643,040, 31,098,420, 34,553,800
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 5
Divisible by 8No, remainder 4
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 5
Divisible by 12No, remainder 4
Divisible by 100No, remainder 80
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Highest value reached3,455,380
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,455,380 → 1,727,690 → 863,845 → 2,591,536 → 1,295,768 → 647,884 → 323,942 → 161,971 → 485,914 → 242,957 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage345,538,000%
3,455,380% as a decimal34,553.8
3,455,380% of 1003,455,380
3,455,380% of 1,00034,553,800
As a fraction of 1003,455,380/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,455,380
Nerdulate something else
Nothing in mind? Surprise me · today’s page