Recognised as Number

7,309,701

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value7,309,701

Digit count7

Digit sum27

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 7 × 116,027

Distinct prime factors33, 7, 116,027

Number of divisors12

Sum of divisors σ(n)12,066,912

Aliquot sum4,757,211sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)4,176,936integers below n that share no factor with it

Carmichael function λ(n)348,078the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,176,936

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 9, 21, 63, 116,027, 348,081, 812,189, 1,044,243, 2,436,567, 7,309,70112 in total

Arithmetic

Previous number7,309,700

Next number7,309,702

Double14,619,402

Half3,654,850.5

Square53,431,728,709,401

Cube390,569,960,778,837,199,101

Square root2,703.645871781≈irrational, shown to 9 decimal places

Cube root194.073633791≈

Negation-7,309,701

Reciprocal1.36804501 × 10^-7≈

Representations

Decimal7,309,701

Binary1101111100010011000010123 bits

Octal33704605

Hexadecimal6F8985

Base 364CO79

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

In wordsseven million, three hundred and nine thousand, seven hundred and one

Ordinalseven million, three hundred and nine thousand, seven hundred and first

Scientific notation7.309701 × 10^6

Engineering notation7.309701 × 10^6

In other bases

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

Quinary3332402301base 5; one hand: 10 digits

Septenary116063040base 7: 9 digits

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

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

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

Sexagesimal33:50:28:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000011011111000100110000101

Bit length23 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits11within that length

Bit parityeven12 set bits, so even; not the same as the number itself being odd

Highest set bitbit 22worth 4,194,304

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes36f 89 85

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

At each machine width

32-bit00000000011011111000100110000101

64-bit0000000000000000000000000000000000000000011011111000100110000101

One's complement11111111100100000111011001111010at 32 bits, every bit flipped

Bits reversed10100001100100011111011000000000at 32 bits

Rotated left by 100000000110111110001001100001010at 32 bits, wrapping

Shifted left by 1110111110001001100001010= 14,619,402, no wrap

Shifted right by 11101111100010011000010= 3,654,850, discarding the low bit

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

Nearest landmarks

Next prime7,309,723+22

Previous prime7,309,697−4

Distance to nearest prime4

Nearest square below7,306,209

Nearest square above7,311,616

Powers & multiples

7,309,701 to the power 253,431,728,709,401

7,309,701 to the power 3390,569,960,778,837,199,101

7,309,701 to the power 42,854,949,632,875,027,053,105,778,801

7,309,701 to the power 520,868,828,186,376,218,125,114,364,407,448,501

First ten multiples7,309,701, 14,619,402, 21,929,103, 29,238,804, 36,548,505, 43,858,206, 51,167,907, 58,477,608, 65,787,309, 73,097,010

Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 3

Divisible by 12No, remainder 9

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1266the total stopping time

Highest value reached21,929,1043× the starting value

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

First steps7,309,701 → 21,929,104 → 10,964,552 → 5,482,276 → 2,741,138 → 1,370,569 → 4,111,708 → 2,055,854 → 1,027,927 → 3,083,782 → …

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

As a percentage & fraction

As a percentage730,970,100%

7,309,701% as a decimal73,097.01

7,309,701% of 1007,309,701

7,309,701% of 1,00073,097,010

As a fraction of 1007,309,701/100

Read another way

As seconds84 days, 14 hours and 28 minutes

As bytes6.971 MiB

As a 24-bit colour#6F8985

Keep nerding

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