Recognised as Number
3,473,975
- Positive
- Odd
- Composite
- 7 digits
3,473,975 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,473,975
Digit count7
Digit sum38
Digit product79,380
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5^2 × 138,959
Distinct prime factors25, 138,959
Number of divisors6
Sum of divisors σ(n)4,307,760
Aliquot sum833,785sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,779,160integers below n that share no factor with it
Carmichael function λ(n)1,389,580the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,779,160
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 25, 138,959, 694,795, 3,473,9756 in total
Arithmetic
Previous number3,473,974
Next number3,473,976
Double6,947,950
Half1,736,987.5
Square12,068,502,300,625
Cube41,925,675,279,813,734,375
Square root1,863.860241542≈irrational, shown to 9 decimal places
Cube root151.452191852≈
Negation-3,473,975
Reciprocal2.87854691 × 10^-7≈
Representations
Decimal3,473,975
Binary110101000000100011011122 bits
Octal15201067
Hexadecimal350237
Base 3622GJB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and seventy-three thousand, nine hundred and seventy-five
Ordinalthree million, four hundred and seventy-three thousand, nine hundred and seventy-fifth
Scientific notation3.473975 × 10^6
Engineering notation3.473975 × 10^6
In other bases
Ternary20112111101202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1342131400base 5; one hand: 10 digits
Septenary41346131base 7: 8 digits
Nonary6474352base 9; each digit is two ternary digits: 7 digits
Duodecimal11b649bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11e4ifbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:4:59:35base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TTT11111TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010000011001001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010000001000110111
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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
Bytes335 02 37
Gray code1011111000001100101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010000001000110111
64-bit0000000000000000000000000000000000000000001101010000001000110111
One's complement11111111110010101111110111001000at 32 bits, every bit flipped
Bits reversed11101100010000001010110000000000at 32 bits
Rotated left by 100000000011010100000010001101110at 32 bits, wrapping
Shifted left by 111010100000010001101110= 6,947,950, no wrap
Shifted right by 1110101000000100011011= 1,736,987, discarding the low bit
These bits as a double1.7163717 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,473,975 to the power 212,068,502,300,625
3,473,975 to the power 341,925,675,279,813,734,375
3,473,975 to the power 4145,648,747,780,190,917,875,390,625
3,473,975 to the power 5505,980,108,569,688,743,926,160,146,484,375
First ten multiples3,473,975, 6,947,950, 10,421,925, 13,895,900, 17,369,875, 20,843,850, 24,317,825, 27,791,800, 31,265,775, 34,739,750
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 2
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 5
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 75
Collatz (3n + 1) trajectory
Steps to reach 1265the total stopping time
Highest value reached156,479,84845× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,473,975 → 10,421,926 → 5,210,963 → 15,632,890 → 7,816,445 → 23,449,336 → 11,724,668 → 5,862,334 → 2,931,167 → 8,793,502 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage347,397,500%
3,473,975% as a decimal34,739.75
3,473,975% of 1003,473,975
3,473,975% of 1,00034,739,750
As a fraction of 1003,473,975/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,473,975
Nerdulate something else
Nothing in mind? Surprise me · today’s page