Nerdulator> put something in

Recognised as Number

9,801,145

  • Positive
  • Odd
  • Composite
  • 7 digits

9,801,145 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value9,801,145
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 47 × 179 × 233
Distinct prime factors45, 47, 179, 233
Number of divisors16
Sum of divisors σ(n)12,130,560
Aliquot sum2,329,415sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,598,464integers below n that share no factor with it
Carmichael function λ(n)474,904the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 7,598,464
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 47, 179, 233, 235, 895, 1,165, 8,413, 10,951, 41,707, 42,065, 54,755, 208,535, 1,960,229, 9,801,14516 in total

Arithmetic

Previous number9,801,144
Next number9,801,146
Cube941,521,935,945,636,123,625
Square root3,130.678041575≈irrational, shown to 9 decimal places
Cube root214.005830045≈
Negation-9,801,145
Reciprocal1.02028896 × 10^-7≈

Representations

Decimal9,801,145
Binary10010101100011011011100124 bits
Octal45306671
Hexadecimal958DB9
Base 365U2M1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, eight hundred and one thousand, one hundred and forty-five
Ordinalnine million, eight hundred and one thousand, one hundred and forty-fifth
Scientific notation9.801145 × 10^6
Engineering notation9.801145 × 10^6

In other bases

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

Bit-level

00000000100101011000110110111001
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
Bytes395 8d b9
Gray code110111110100101101100101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100101011000110110111001
64-bit0000000000000000000000000000000000000000100101011000110110111001
One's complement11111111011010100111001001000110at 32 bits, every bit flipped
Bits reversed10011101101100011010100100000000at 32 bits
Rotated left by 100000001001010110001101101110010at 32 bits, wrapping
Shifted left by 11001010110001101101110010= 19,602,290, no wrap
Shifted right by 110010101100011011011100= 4,900,572, discarding the low bit
These bits as a double4.84240903 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,801,149+4
Previous prime9,801,137−8
Distance to nearest prime4
Nearest square below9,796,900
Nearest square above9,803,161

Powers & multiples

9,801,145 to the power 296,062,443,311,025
9,801,145 to the power 3941,521,935,945,636,123,625
9,801,145 to the power 49,227,993,014,883,891,764,886,550,625
9,801,145 to the power 590,444,897,597,864,181,351,958,991,225,465,625
First ten multiples9,801,145, 19,602,290, 29,403,435, 39,204,580, 49,005,725, 58,806,870, 68,608,015, 78,409,160, 88,210,305, 98,011,450
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 5
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 45

Collatz (3n + 1) trajectory

Steps to reach 1114the total stopping time
Highest value reached33,078,8683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,801,145 → 29,403,436 → 14,701,718 → 7,350,859 → 22,052,578 → 11,026,289 → 33,078,868 → 16,539,434 → 8,269,717 → 24,809,152 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage980,114,500%
9,801,145% as a decimal98,011.45
9,801,145% of 1009,801,145
9,801,145% of 1,00098,011,450
As a fraction of 1009,801,145/100

Read another way

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

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 “9801145” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.