Nerdulator> put something in

Recognised as Number

9,801,149

  • Positive
  • Odd
  • Prime
  • 7 digits

9,801,149 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 value9,801,149
Digit count7
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation9,801,149
Distinct prime factors19,801,149
Number of divisors2
Sum of divisors σ(n)9,801,150
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,801,148integers below n that share no factor with it
Carmichael function λ(n)9,801,148the 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,801,1492 in total

Arithmetic

Previous number9,801,148
Next number9,801,150
Cube941,523,088,695,426,310,949
Square root3,130.678680414≈irrational, shown to 9 decimal places
Cube root214.005859158≈
Negation-9,801,149
Reciprocal1.02028854 × 10^-7≈

Representations

Decimal9,801,149
Binary10010101100011011011110124 bits
Octal45306675
Hexadecimal958DBD
Base 365U2M5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, eight hundred and one thousand, one hundred and forty-nine
Ordinalnine million, eight hundred and one thousand, one hundred and forty-ninth
Scientific notation9.801149 × 10^6
Engineering notation9.801149 × 10^6

In other bases

Ternary200102221122112base 3; the most digit-efficient integer base after e: 15 digits
Quinary10002114044base 5; one hand: 11 digits
Septenary146210531base 7: 9 digits
Nonary20387575base 9; each digit is two ternary digits: 8 digits
Duodecimal3347b65base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal3152h9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:22:32:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0011000TT00TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010101001001011001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100101011000110110111101
Bit length24 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits10within that length
Bit parityeven14 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
Bytes395 8d bd
Gray code110111110100101101100011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100101011000110110111101
64-bit0000000000000000000000000000000000000000100101011000110110111101
One's complement11111111011010100111001001000010at 32 bits, every bit flipped
Bits reversed10111101101100011010100100000000at 32 bits
Rotated left by 100000001001010110001101101111010at 32 bits, wrapping
Shifted left by 11001010110001101101111010= 19,602,298, no wrap
Shifted right by 110010101100011011011110= 4,900,574, discarding the low bit
These bits as a double4.84241101 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,801,157+8
Previous prime9,801,137−12
Distance to nearest prime0, it is prime
Nearest square below9,796,900
Nearest square above9,803,161

Powers & multiples

9,801,149 to the power 296,062,521,720,201
9,801,149 to the power 3941,523,088,695,426,310,949
9,801,149 to the power 49,228,008,079,244,088,892,131,480,401
9,801,149 to the power 590,445,082,157,875,122,601,025,567,000,780,749
First ten multiples9,801,149, 19,602,298, 29,403,447, 39,204,596, 49,005,745, 58,806,894, 68,608,043, 78,409,192, 88,210,341, 98,011,490
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 49

Collatz (3n + 1) trajectory

Steps to reach 1114the total stopping time
Highest value reached29,403,4483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,801,149 → 29,403,448 → 14,701,724 → 7,350,862 → 3,675,431 → 11,026,294 → 5,513,147 → 16,539,442 → 8,269,721 → 24,809,164 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage980,114,900%
9,801,149% as a decimal98,011.49
9,801,149% of 1009,801,149
9,801,149% of 1,00098,011,490
As a fraction of 1009,801,149/100

Read another way

As bytes9.347 MiB
As a 24-bit colour#958DBD

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “9801149” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.