Recognised as Number
3,473,973
- Positive
- Odd
- Composite
- 7 digits
3,473,973 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,473,973
Digit count7
Digit sum36
Digit product47,628
Multiplicative persistence7times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 385,997
Distinct prime factors23, 385,997
Number of divisors6
Sum of divisors σ(n)5,017,974
Aliquot sum1,544,001sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,315,976integers below n that share no factor with it
Carmichael function λ(n)1,157,988the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,315,976
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 385,997, 1,157,991, 3,473,9736 in total
Arithmetic
Previous number3,473,972
Next number3,473,974
Double6,947,946
Half1,736,986.5
Square12,068,488,404,729
Cube41,925,602,868,841,618,317
Square root1,863.859705021≈irrational, shown to 9 decimal places
Cube root151.452162788≈
Negation-3,473,973
Reciprocal2.87854857 × 10^-7≈
Representations
Decimal3,473,973
Binary110101000000100011010122 bits
Octal15201065
Hexadecimal350235
Base 3622GJ9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and seventy-three thousand, nine hundred and seventy-three
Ordinalthree million, four hundred and seventy-three thousand, nine hundred and seventy-third
Scientific notation3.473973 × 10^6
Engineering notation3.473973 × 10^6
In other bases
Ternary20112111101200base 3; the most digit-efficient integer base after e: 14 digits
Quinary1342131343base 5; one hand: 10 digits
Septenary41346126base 7: 8 digits
Nonary6474350base 9; each digit is two ternary digits: 7 digits
Duodecimal11b6499base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11e4idbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:4:59:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TTT11111TT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010000011001110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010000001000110101
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 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
Bytes335 02 35
Gray code1011111000001100101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010000001000110101
64-bit0000000000000000000000000000000000000000001101010000001000110101
One's complement11111111110010101111110111001010at 32 bits, every bit flipped
Bits reversed10101100010000001010110000000000at 32 bits
Rotated left by 100000000011010100000010001101010at 32 bits, wrapping
Shifted left by 111010100000010001101010= 6,947,946, no wrap
Shifted right by 1110101000000100011010= 1,736,986, discarding the low bit
These bits as a double1.71637071 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,473,973 to the power 212,068,488,404,729
3,473,973 to the power 341,925,602,868,841,618,317
3,473,973 to the power 4145,648,412,375,078,323,309,563,441
3,473,973 to the power 5505,978,652,083,887,968,062,694,035,821,093
First ten multiples3,473,973, 6,947,946, 10,421,919, 13,895,892, 17,369,865, 20,843,838, 24,317,811, 27,791,784, 31,265,757, 34,739,730
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 145the total stopping time
Highest value reached10,421,9203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,473,973 → 10,421,920 → 5,210,960 → 2,605,480 → 1,302,740 → 651,370 → 325,685 → 977,056 → 488,528 → 244,264 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage347,397,300%
3,473,973% as a decimal34,739.73
3,473,973% of 1003,473,973
3,473,973% of 1,00034,739,730
As a fraction of 1003,473,973/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,973
Nerdulate something else
Nothing in mind? Surprise me · today’s page