Recognised as Number

9,955,025

Positive
Odd
Composite
7 digits

9,955,025 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value9,955,025

Digit count7

Digit sum35

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5^2 × 491 × 811

Distinct prime factors35, 491, 811

Number of divisors12

Sum of divisors σ(n)12,384,624

Aliquot sum2,429,599sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)7,938,000integers below n that share no factor with it

Carmichael function λ(n)79,380the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 7,938,000

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 5, 25, 491, 811, 2,455, 4,055, 12,275, 20,275, 398,201, 1,991,005, 9,955,02512 in total

Arithmetic

Previous number9,955,024

Next number9,955,026

Double19,910,050

Half4,977,512.5

Square99,102,522,750,625

Cube986,568,091,545,540,640,625

Square root3,155.158474625≈irrational, shown to 9 decimal places

Cube root215.119997913≈

Negation-9,955,025

Reciprocal1.00451782 × 10^-7≈

Representations

Decimal9,955,025

Binary10010111111001101101000124 bits

Octal45763321

Hexadecimal97E6D1

Base 365XDCH

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsnine million, nine hundred and fifty-five thousand and twenty-five

Ordinalnine million, nine hundred and fifty-five thousand and twenty-fifth

Scientific notation9.955025 × 10^6

Engineering notation9.955025 × 10^6

In other bases

Ternary200201202201122base 3; the most digit-efficient integer base after e: 15 digits

Quinary10022030100base 5; one hand: 11 digits

Septenary150421253base 7: 9 digits

Nonary20652648base 9; each digit is two ternary digits: 8 digits

Duodecimal3401015base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal3247b5base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal46:5:17:5base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T01T1TT10T1TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1111010000011101111010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100101111110011011010001

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

Bytes397 e6 d1

Gray code110111000001010110111001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100101111110011011010001

64-bit0000000000000000000000000000000000000000100101111110011011010001

One's complement11111111011010000001100100101110at 32 bits, every bit flipped

Bits reversed10001011011001111110100100000000at 32 bits

Rotated left by 100000001001011111100110110100010at 32 bits, wrapping

Shifted left by 11001011111100110110100010= 19,910,050, no wrap

Shifted right by 110010111111001101101000= 4,977,512, discarding the low bit

These bits as a double4.91843586 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,955,073+48

Previous prime9,955,009−16

Distance to nearest prime16

Nearest square below9,954,025

Nearest square above9,960,336

Powers & multiples

9,955,025 to the power 299,102,522,750,625

9,955,025 to the power 3986,568,091,545,540,640,625

9,955,025 to the power 49,821,310,015,538,145,715,937,890,625

9,955,025 to the power 597,771,386,737,432,629,055,804,599,619,140,625

First ten multiples9,955,025, 19,910,050, 29,865,075, 39,820,100, 49,775,125, 59,730,150, 69,685,175, 79,640,200, 89,595,225, 99,550,250

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 5Yes

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 5

Divisible by 11No, remainder 3

Divisible by 12No, remainder 5

Divisible by 100No, remainder 25

Collatz (3n + 1) trajectory

Steps to reach 1114the total stopping time

Highest value reached29,865,0763× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps9,955,025 → 29,865,076 → 14,932,538 → 7,466,269 → 22,398,808 → 11,199,404 → 5,599,702 → 2,799,851 → 8,399,554 → 4,199,777 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage995,502,500%

9,955,025% as a decimal99,550.25

9,955,025% of 1009,955,025

9,955,025% of 1,00099,550,250

As a fraction of 1009,955,025/100

Read another way

As seconds115 days, 5 hours and 17 minutes

As bytes9.494 MiB

As a 24-bit colour#97E6D1

Keep nerding

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