Recognised as Number
9,100,739
- Positive
- Odd
- Prime
- 7 digits
9,100,739 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,100,739
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,100,739
Distinct prime factors19,100,739
Number of divisors2
Sum of divisors σ(n)9,100,740
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,100,738integers below n that share no factor with it
Carmichael function λ(n)9,100,738the 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,100,7392 in total
Arithmetic
Previous number9,100,738
Next number9,100,740
Double18,201,478
Half4,550,369.5
Square82,823,450,346,121
Cube753,754,604,679,506,883,419
Square root3,016.74311137≈irrational, shown to 9 decimal places
Cube root208.781599194≈
Negation-9,100,739
Reciprocal1.09881187 × 10^-7≈
Representations
Decimal9,100,739
Binary10001010110111011100001124 bits
Octal42556703
Hexadecimal8ADDC3
Base 365F26B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, one hundred thousand, seven hundred and thirty-nine
Ordinalnine million, one hundred thousand, seven hundred and thirty-ninth
Scientific notation9.100739 × 10^6
Engineering notation9.100739 × 10^6
In other bases
Ternary122010100212102base 3; the most digit-efficient integer base after e: 15 digits
Quinary4312210424base 5; one hand: 10 digits
Septenary140232524base 7: 9 digits
Nonary18110772base 9; each digit is two ternary digits: 8 digits
Duodecimal306a76bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2ghbgjbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal42:7:58:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T0101010TT11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100111110010001011000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100010101101110111000011
Bit length24 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits11within that length
Bit parityodd13 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
Bytes38a dd c3
Gray code110011111011001100100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100010101101110111000011
64-bit0000000000000000000000000000000000000000100010101101110111000011
One's complement11111111011101010010001000111100at 32 bits, every bit flipped
Bits reversed11000011101110110101000100000000at 32 bits
Rotated left by 100000001000101011011101110000110at 32 bits, wrapping
Shifted left by 11000101011011101110000110= 18,201,478, no wrap
Shifted right by 110001010110111011100001= 4,550,369, discarding the low bit
These bits as a double4.49636249 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,100,739 to the power 282,823,450,346,121
9,100,739 to the power 3753,754,604,679,506,883,419
9,100,739 to the power 46,859,723,927,236,370,794,699,746,641
9,100,739 to the power 562,428,557,073,833,201,909,784,977,545,867,699
First ten multiples9,100,739, 18,201,478, 27,302,217, 36,402,956, 45,503,695, 54,604,434, 63,705,173, 72,805,912, 81,906,651, 91,007,390
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 39
Collatz (3n + 1) trajectory
Steps to reach 1225the total stopping time
Highest value reached49,870,8885× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,100,739 → 27,302,218 → 13,651,109 → 40,953,328 → 20,476,664 → 10,238,332 → 5,119,166 → 2,559,583 → 7,678,750 → 3,839,375 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage910,073,900%
9,100,739% as a decimal91,007.39
9,100,739% of 1009,100,739
9,100,739% of 1,00091,007,390
As a fraction of 1009,100,739/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,100,739
Nerdulate something else
Nothing in mind? Surprise me · today’s page