Recognised as Number

9,162,729

Positive
Odd
Composite
Perfect square
7 digits

9,162,729 is an odd 7-digit integer and a composite number. It has 9 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value9,162,729

Digit count7

Digit sum36

Digit product13,608

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 3,027²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 1,009^2

Distinct prime factors23, 1,009

Number of divisors9

Sum of divisors σ(n)13,248,183

Aliquot sum4,085,454sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)6,102,432integers below n that share no factor with it

Carmichael function λ(n)1,017,072the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,102,432

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 1,009, 3,027, 9,081, 1,018,081, 3,054,243, 9,162,7299 in total

Arithmetic

Previous number9,162,728

Next number9,162,730

Double18,325,458

Half4,581,364.5

Square83,955,602,727,441

Cube769,262,435,823,202,746,489

Square root3,027exact

Cube root209.254567973≈

Negation-9,162,729

Reciprocal1.09137791 × 10^-7≈

Representations

Decimal9,162,729

Binary10001011110011111110100124 bits

Octal42747751

Hexadecimal8BCFE9

Base 365GE09

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

In wordsnine million, one hundred and sixty-two thousand, seven hundred and twenty-nine

Ordinalnine million, one hundred and sixty-two thousand, seven hundred and twenty-ninth

Scientific notation9.162729 × 10^6

Engineering notation9.162729 × 10^6

In other bases

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

Quinary4321201404base 5; one hand: 10 digits

Septenary140611332base 7: 9 digits

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

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

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

Sexagesimal42:25:12:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000100010111100111111101001

Bit length24 bitsto write the magnitude

Set bits15the population count, or Hamming weight

Zero bits9within that length

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

Bytes38b cf e9

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

At each machine width

32-bit00000000100010111100111111101001

64-bit0000000000000000000000000000000000000000100010111100111111101001

One's complement11111111011101000011000000010110at 32 bits, every bit flipped

Bits reversed10010111111100111101000100000000at 32 bits

Rotated left by 100000001000101111001111111010010at 32 bits, wrapping

Shifted left by 11000101111001111111010010= 18,325,458, no wrap

Shifted right by 110001011110011111110100= 4,581,364, discarding the low bit

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

Nearest landmarks

Next prime9,162,737+8

Previous prime9,162,709−20

Distance to nearest prime8

Nearest square below9,162,729

Nearest square above9,168,784

Powers & multiples

9,162,729 to the power 283,955,602,727,441

9,162,729 to the power 3769,262,435,823,202,746,489

9,162,729 to the power 47,048,543,229,327,898,678,134,408,481

9,162,729 to the power 564,583,891,455,116,387,727,203,810,486,704,649

First ten multiples9,162,729, 18,325,458, 27,488,187, 36,650,916, 45,813,645, 54,976,374, 64,139,103, 73,301,832, 82,464,561, 91,627,290

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 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 9

Divisible by 11No, remainder 4

Divisible by 12No, remainder 9

Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 1132the total stopping time

Highest value reached117,415,38412× the starting value

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

First steps9,162,729 → 27,488,188 → 13,744,094 → 6,872,047 → 20,616,142 → 10,308,071 → 30,924,214 → 15,462,107 → 46,386,322 → 23,193,161 → …

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

As a percentage & fraction

As a percentage916,272,900%

9,162,729% as a decimal91,627.29

9,162,729% of 1009,162,729

9,162,729% of 1,00091,627,290

As a fraction of 1009,162,729/100

Read another way

As seconds106 days, 1 hour and 12 minutes

As bytes8.738 MiB

As a 24-bit colour#8BCFE9

Keep nerding

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