Recognised as Number

9,018,753

Positive
Odd
Composite
7 digits

9,018,753 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value9,018,753

Digit count7

Digit sum33

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 487 × 6,173

Distinct prime factors33, 487, 6,173

Number of divisors8

Sum of divisors σ(n)12,051,648

Aliquot sum3,032,895sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)5,999,184integers below n that share no factor with it

Carmichael function λ(n)1,499,796the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,999,184

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 487, 1,461, 6,173, 18,519, 3,006,251, 9,018,7538 in total

Arithmetic

Previous number9,018,752

Next number9,018,754

Double18,037,506

Half4,509,376.5

Square81,337,905,675,009

Cube733,566,480,820,204,443,777

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

Cube root208.152755454≈

Negation-9,018,753

Reciprocal1.10880074 × 10^-7≈

Representations

Decimal9,018,753

Binary10001001100111011000000124 bits

Octal42316601

Hexadecimal899D81

Base 365DAWX

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

In wordsnine million, eighteen thousand, seven hundred and fifty-three

Ordinalnine million, eighteen thousand, seven hundred and fifty-third

Scientific notation9.018753 × 10^6

Engineering notation9.018753 × 10^6

In other bases

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

Quinary4302100003base 5; one hand: 10 digits

Septenary136441512base 7: 9 digits

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

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

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

Sexagesimal41:45:12:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000100010011001110110000001

Bit length24 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits14within that length

Bit parityeven10 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

Bytes389 9d 81

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

At each machine width

32-bit00000000100010011001110110000001

64-bit0000000000000000000000000000000000000000100010011001110110000001

One's complement11111111011101100110001001111110at 32 bits, every bit flipped

Bits reversed10000001101110011001000100000000at 32 bits

Rotated left by 100000001000100110011101100000010at 32 bits, wrapping

Shifted left by 11000100110011101100000010= 18,037,506, no wrap

Shifted right by 110001001100111011000000= 4,509,376, discarding the low bit

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

Nearest landmarks

Next prime9,018,761+8

Previous prime9,018,743−10

Distance to nearest prime8

Nearest square below9,018,009

Nearest square above9,024,016

Powers & multiples

9,018,753 to the power 281,337,905,675,009

9,018,753 to the power 3733,566,480,820,204,443,777

9,018,753 to the power 46,615,854,899,596,661,287,927,150,081

9,018,753 to the power 559,666,761,223,302,087,780,476,848,574,468,993

First ten multiples9,018,753, 18,037,506, 27,056,259, 36,075,012, 45,093,765, 54,112,518, 63,131,271, 72,150,024, 81,168,777, 90,187,530

Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 6

Divisible by 10No, remainder 3

Divisible by 11No, remainder 7

Divisible by 12No, remainder 9

Divisible by 100No, remainder 53

Collatz (3n + 1) trajectory

Steps to reach 1111the total stopping time

Highest value reached27,056,2603× the starting value

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

First steps9,018,753 → 27,056,260 → 13,528,130 → 6,764,065 → 20,292,196 → 10,146,098 → 5,073,049 → 15,219,148 → 7,609,574 → 3,804,787 → …

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

As a percentage & fraction

As a percentage901,875,300%

9,018,753% as a decimal90,187.53

9,018,753% of 1009,018,753

9,018,753% of 1,00090,187,530

As a fraction of 1009,018,753/100

Read another way

As seconds104 days, 9 hours and 12 minutes

As bytes8.601 MiB

As a 24-bit colour#899D81

Keep nerding

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