Recognised as Number
9,339,702
- Positive
- Even
- Composite
- 7 digits
9,339,702 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value9,339,702
Digit count7
Digit sum33
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 23 × 67,679
Distinct prime factors42, 3, 23, 67,679
Number of divisors16
Sum of divisors σ(n)19,491,840
Aliquot sum10,152,138sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)2,977,832integers below n that share no factor with it
Carmichael function λ(n)744,458the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,977,832
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 23, 46, 69, 138, 67,679, 135,358, 203,037, 406,074, 1,556,617, 3,113,234, 4,669,851, 9,339,70216 in total
Arithmetic
Previous number9,339,701
Next number9,339,703
Double18,679,404
Half4,669,851
Square87,230,033,448,804
Cube814,702,517,861,861,616,408
Square root3,056.092603309≈irrational, shown to 9 decimal places
Cube root210.593198068≈
Negation-9,339,702
Reciprocal1.07069797 × 10^-7≈
Representations
Decimal9,339,702
Binary10001110100000110011011024 bits
Octal43501466
Hexadecimal8E8336
Base 365K6K6
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, three hundred and thirty-nine thousand, seven hundred and two
Ordinalnine million, three hundred and thirty-nine thousand, seven hundred and second
Scientific notation9.339702 × 10^6
Engineering notation9.339702 × 10^6
In other bases
Ternary122120111122220base 3; the most digit-efficient integer base after e: 15 digits
Quinary4342332302base 5; one hand: 10 digits
Septenary142246311base 7: 9 digits
Nonary18514586base 9; each digit is two ternary digits: 8 digits
Duodecimal3164b06base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2i7952base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal43:14:21:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00TT1TTTT000T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100100111000011101001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100011101000001100110110
Bit length24 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits13within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes38e 83 36
Gray code110010011100001010101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100011101000001100110110
64-bit0000000000000000000000000000000000000000100011101000001100110110
One's complement11111111011100010111110011001001at 32 bits, every bit flipped
Bits reversed01101100110000010111000100000000at 32 bits
Rotated left by 100000001000111010000011001101100at 32 bits, wrapping
Shifted left by 11000111010000011001101100= 18,679,404, no wrap
Shifted right by 110001110100000110011011= 4,669,851, discarding the low bit
These bits as a double4.6144259 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,339,702 to the power 287,230,033,448,804
9,339,702 to the power 3814,702,517,861,861,616,408
9,339,702 to the power 47,609,078,735,479,464,662,489,030,416
9,339,702 to the power 571,066,527,883,915,027,067,178,122,354,376,032
First ten multiples9,339,702, 18,679,404, 28,019,106, 37,358,808, 46,698,510, 56,038,212, 65,377,914, 74,717,616, 84,057,318, 93,397,020
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 1
Divisible by 8No, remainder 6
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 6
Divisible by 100No, remainder 2
Collatz (3n + 1) trajectory
Steps to reach 1155the total stopping time
Highest value reached121,316,12812× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,339,702 → 4,669,851 → 14,009,554 → 7,004,777 → 21,014,332 → 10,507,166 → 5,253,583 → 15,760,750 → 7,880,375 → 23,641,126 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage933,970,200%
9,339,702% as a decimal93,397.02
9,339,702% of 1009,339,702
9,339,702% of 1,00093,397,020
As a fraction of 1009,339,702/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,339,702
Nerdulate something else
Nothing in mind? Surprise me · today’s page