Recognised as Number
9,967,669
- Positive
- Odd
- Prime
- 7 digits
9,967,669 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,967,669
Digit count7
Digit sum52
Digit product1,102,248
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,967,669
Distinct prime factors19,967,669
Number of divisors2
Sum of divisors σ(n)9,967,670
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,967,668integers below n that share no factor with it
Carmichael function λ(n)9,967,668the 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,967,6692 in total
Arithmetic
Previous number9,967,668
Next number9,967,670
Double19,935,338
Half4,983,834.5
Square99,354,425,293,561
Cube990,332,025,011,443,879,309
Square root3,157.161541638≈irrational, shown to 9 decimal places
Cube root215.211034902≈
Negation-9,967,669
Reciprocal1.00324359 × 10^-7≈
Representations
Decimal9,967,669
Binary10011000000110000011010124 bits
Octal46014065
Hexadecimal981835
Base 365XN3P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, nine hundred and sixty-seven thousand, six hundred and sixty-nine
Ordinalnine million, nine hundred and sixty-seven thousand, six hundred and sixty-ninth
Scientific notation9.967669 × 10^6
Engineering notation9.967669 × 10^6
In other bases
Ternary200202102001221base 3; the most digit-efficient integer base after e: 15 digits
Quinary10022431134base 5; one hand: 11 digits
Septenary150503155base 7: 9 digits
Nonary20672057base 9; each digit is two ternary digits: 8 digits
Duodecimal34083b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal325j39base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:8:47:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T1T11T01T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010000110100001110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100110000001100000110101
Bit length24 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits15within that length
Bit parityodd9 set bits, so odd; 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
Bytes398 18 35
Gray code110101000001010000101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100110000001100000110101
64-bit0000000000000000000000000000000000000000100110000001100000110101
One's complement11111111011001111110011111001010at 32 bits, every bit flipped
Bits reversed10101100000110000001100100000000at 32 bits
Rotated left by 100000001001100000011000001101010at 32 bits, wrapping
Shifted left by 11001100000011000001101010= 19,935,338, no wrap
Shifted right by 110011000000110000011010= 4,983,834, discarding the low bit
These bits as a double4.92468282 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,967,669 to the power 299,354,425,293,561
9,967,669 to the power 3990,332,025,011,443,879,309
9,967,669 to the power 49,871,301,825,413,793,801,028,060,721
9,967,669 to the power 598,393,869,194,820,484,642,899,568,978,829,349
First ten multiples9,967,669, 19,935,338, 29,903,007, 39,870,676, 49,838,345, 59,806,014, 69,773,683, 79,741,352, 89,709,021, 99,676,690
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 69
Collatz (3n + 1) trajectory
Steps to reach 1114the total stopping time
Highest value reached29,903,0083× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,967,669 → 29,903,008 → 14,951,504 → 7,475,752 → 3,737,876 → 1,868,938 → 934,469 → 2,803,408 → 1,401,704 → 700,852 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage996,766,900%
9,967,669% as a decimal99,676.69
9,967,669% of 1009,967,669
9,967,669% of 1,00099,676,690
As a fraction of 1009,967,669/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,967,669
Nerdulate something else
Nothing in mind? Surprise me · today’s page