Recognised as Number
3,315,973
- Positive
- Odd
- Composite
- 7 digits
3,315,973 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,315,973
Digit count7
Digit sum31
Digit product8,505
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 factorisation461 × 7,193
Distinct prime factors2461, 7,193
Number of divisors4
Sum of divisors σ(n)3,323,628
Aliquot sum7,655sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,308,320integers below n that share no factor with it
Carmichael function λ(n)827,080the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,308,320
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 461, 7,193, 3,315,9734 in total
Arithmetic
Previous number3,315,972
Next number3,315,974
Double6,631,946
Half1,657,986.5
Square10,995,676,936,729
Cube36,461,367,838,916,072,317
Square root1,820.981328844≈irrational, shown to 9 decimal places
Cube root149.120377774≈
Negation-3,315,973
Reciprocal3.0157061 × 10^-7≈
Representations
Decimal3,315,973
Binary110010100110010000010122 bits
Octal14514405
Hexadecimal329905
Base 361Z2MD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and fifteen thousand, nine hundred and seventy-three
Ordinalthree million, three hundred and fifteen thousand, nine hundred and seventy-third
Scientific notation3.315973 × 10^6
Engineering notation3.315973 × 10^6
In other bases
Ternary20020110122211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1322102343base 5; one hand: 10 digits
Septenary40120363base 7: 8 digits
Nonary6213584base 9; each digit is two ternary digits: 7 digits
Duodecimal113ab71base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10e9idbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:21:6:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T0111T00T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111110100100000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101001100100000101
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
Bytes332 99 05
Gray code1010111101010110000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101001100100000101
64-bit0000000000000000000000000000000000000000001100101001100100000101
One's complement11111111110011010110011011111010at 32 bits, every bit flipped
Bits reversed10100000100110010100110000000000at 32 bits
Rotated left by 100000000011001010011001000001010at 32 bits, wrapping
Shifted left by 111001010011001000001010= 6,631,946, no wrap
Shifted right by 1110010100110010000010= 1,657,986, discarding the low bit
These bits as a double1.63830834 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,315,973 to the power 210,995,676,936,729
3,315,973 to the power 336,461,367,838,916,072,317
3,315,973 to the power 4120,904,911,296,914,045,069,219,441
3,315,973 to the power 5400,917,421,427,961,956,770,314,797,431,093
First ten multiples3,315,973, 6,631,946, 9,947,919, 13,263,892, 16,579,865, 19,895,838, 23,211,811, 26,527,784, 29,843,757, 33,159,730
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached9,947,9203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,315,973 → 9,947,920 → 4,973,960 → 2,486,980 → 1,243,490 → 621,745 → 1,865,236 → 932,618 → 466,309 → 1,398,928 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage331,597,300%
3,315,973% as a decimal33,159.73
3,315,973% of 1003,315,973
3,315,973% of 1,00033,159,730
As a fraction of 1003,315,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,315,973
Nerdulate something else
Nothing in mind? Surprise me · today’s page