Recognised as Number
9,704,033
- Positive
- Odd
- Prime
- 7 digits
9,704,033 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,704,033
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,704,033
Distinct prime factors19,704,033
Number of divisors2
Sum of divisors σ(n)9,704,034
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,704,032integers below n that share no factor with it
Carmichael function λ(n)9,704,032the 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, 9,704,0332 in total
Arithmetic
Previous number9,704,032
Next number9,704,034
Double19,408,066
Half4,852,016.5
Square94,168,256,465,089
Cube913,811,868,289,687,003,937
Square root3,115.129692324≈irrational, shown to 9 decimal places
Cube root213.296676373≈
Negation-9,704,033
Reciprocal1.03049938 × 10^-7≈
Representations
Decimal9,704,033
Binary10010100000100100110000124 bits
Octal45011141
Hexadecimal941261
Base 365RZOH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, seven hundred and four thousand and thirty-three
Ordinalnine million, seven hundred and four thousand and thirty-third
Scientific notation9.704033 × 10^6
Engineering notation9.704033 × 10^6
In other bases
Ternary200021000102122base 3; the most digit-efficient integer base after e: 15 digits
Quinary4441012113base 5; one hand: 10 digits
Septenary145324433base 7: 9 digits
Nonary20230378base 9; each digit is two ternary digits: 8 digits
Duodecimal32bb915base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal30d01dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal44:55:33:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001T1000110T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100101000001011110100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100101000001001001100001
Bit length24 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits16within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes394 12 61
Gray code110111100001101101010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100101000001001001100001
64-bit0000000000000000000000000000000000000000100101000001001001100001
One's complement11111111011010111110110110011110at 32 bits, every bit flipped
Bits reversed10000110010010000010100100000000at 32 bits
Rotated left by 100000001001010000010010011000010at 32 bits, wrapping
Shifted left by 11001010000010010011000010= 19,408,066, no wrap
Shifted right by 110010100000100100110000= 4,852,016, discarding the low bit
These bits as a double4.79442933 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,704,033 to the power 294,168,256,465,089
9,704,033 to the power 3913,811,868,289,687,003,937
9,704,033 to the power 48,867,660,525,674,776,245,875,777,921
9,704,033 to the power 586,052,070,373,945,375,957,594,662,846,055,393
First ten multiples9,704,033, 19,408,066, 29,112,099, 38,816,132, 48,520,165, 58,224,198, 67,928,231, 77,632,264, 87,336,297, 97,040,330
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 1207the total stopping time
Highest value reached36,845,0083× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,704,033 → 29,112,100 → 14,556,050 → 7,278,025 → 21,834,076 → 10,917,038 → 5,458,519 → 16,375,558 → 8,187,779 → 24,563,338 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage970,403,300%
9,704,033% as a decimal97,040.33
9,704,033% of 1009,704,033
9,704,033% of 1,00097,040,330
As a fraction of 1009,704,033/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 9,704,033
Nerdulate something else
Nothing in mind? Surprise me · today’s page