Recognised as Number
7,333,961
- Positive
- Odd
- Prime
- 7 digits
7,333,961 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,333,961
Digit count7
Digit sum32
Digit product10,206
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,333,961
Distinct prime factors17,333,961
Number of divisors2
Sum of divisors σ(n)7,333,962
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,333,960integers below n that share no factor with it
Carmichael function λ(n)7,333,960the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7,333,9612 in total
Arithmetic
Previous number7,333,960
Next number7,333,962
Double14,667,922
Half3,666,980.5
Square53,786,983,949,521
Cube394,471,642,593,412,982,681
Square root2,708.128689704≈irrational, shown to 9 decimal places
Cube root194.28809889≈
Negation-7,333,961
Reciprocal1.36351966 × 10^-7≈
Representations
Decimal7,333,961
Binary1101111111010000100100123 bits
Octal33764111
Hexadecimal6FE849
Base 364D6X5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, three hundred and thirty-three thousand, nine hundred and sixty-one
Ordinalseven million, three hundred and thirty-three thousand, nine hundred and sixty-first
Scientific notation7.333961 × 10^6
Engineering notation7.333961 × 10^6
In other bases
Ternary111210121022012base 3; the most digit-efficient integer base after e: 15 digits
Quinary3334141321base 5; one hand: 10 digits
Septenary116223545base 7: 9 digits
Nonary14717265base 9; each digit is two ternary digits: 8 digits
Duodecimal2558235base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal25gei1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal33:57:12:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTT11TT110T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100000011100001011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011011111110100001001001
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes36f e8 49
Gray code10110000001110001101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011011111110100001001001
64-bit0000000000000000000000000000000000000000011011111110100001001001
One's complement11111111100100000001011110110110at 32 bits, every bit flipped
Bits reversed10010010000101111111011000000000at 32 bits
Rotated left by 100000000110111111101000010010010at 32 bits, wrapping
Shifted left by 1110111111101000010010010= 14,667,922, no wrap
Shifted right by 11101111111010000100100= 3,666,980, discarding the low bit
These bits as a double3.62345818 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,333,961 to the power 253,786,983,949,521
7,333,961 to the power 3394,471,642,593,412,982,681
7,333,961 to the power 42,893,039,642,386,029,671,876,129,441
7,333,961 to the power 521,217,439,908,713,088,558,382,330,151,245,801
First ten multiples7,333,961, 14,667,922, 22,001,883, 29,335,844, 36,669,805, 44,003,766, 51,337,727, 58,671,688, 66,005,649, 73,339,610
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1191the total stopping time
Highest value reached237,888,73632× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,333,961 → 22,001,884 → 11,000,942 → 5,500,471 → 16,501,414 → 8,250,707 → 24,752,122 → 12,376,061 → 37,128,184 → 18,564,092 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage733,396,100%
7,333,961% as a decimal73,339.61
7,333,961% of 1007,333,961
7,333,961% of 1,00073,339,610
As a fraction of 1007,333,961/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 7,333,961
Nerdulate something else
Nothing in mind? Surprise me · today’s page