Recognised as Number

9,701,377

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value9,701,377

Digit count7

Digit sum34

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 23 × 60,257

Distinct prime factors37, 23, 60,257

Number of divisors8

Sum of divisors σ(n)11,569,536

Aliquot sum1,868,159sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,988,448the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 7,953,792

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 23, 161, 60,257, 421,799, 1,385,911, 9,701,3778 in total

Arithmetic

Previous number9,701,376

Next number9,701,378

Double19,402,754

Half4,850,688.5

Square94,116,715,696,129

Cube913,061,740,969,964,869,633

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

Cube root213.277214785≈

Negation-9,701,377

Reciprocal1.03078151 × 10^-7≈

Representations

Decimal9,701,377

Binary10010100000010000000000124 bits

Octal45004001

Hexadecimal940801

Base 365RXMP

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

In wordsnine million, seven hundred and one thousand, three hundred and seventy-seven

Ordinalnine million, seven hundred and one thousand, three hundred and seventy-seventh

Scientific notation9.701377 × 10^6

Engineering notation9.701377 × 10^6

In other bases

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

Quinary4440421002base 5; one hand: 10 digits

Septenary145313620base 7: 9 digits

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

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

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

Sexagesimal44:54:49:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000100101000000100000000001

Bit length24 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits19within that length

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

Bytes394 08 01

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

At each machine width

32-bit00000000100101000000100000000001

64-bit0000000000000000000000000000000000000000100101000000100000000001

One's complement11111111011010111111011111111110at 32 bits, every bit flipped

Bits reversed10000000000100000010100100000000at 32 bits

Rotated left by 100000001001010000001000000000010at 32 bits, wrapping

Shifted left by 11001010000001000000000010= 19,402,754, no wrap

Shifted right by 110010100000010000000000= 4,850,688, discarding the low bit

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

Nearest landmarks

Next prime9,701,383+6

Previous prime9,701,347−30

Distance to nearest prime6

Nearest square below9,696,996

Nearest square above9,703,225

Powers & multiples

9,701,377 to the power 294,116,715,696,129

9,701,377 to the power 3913,061,740,969,964,869,633

9,701,377 to the power 48,857,956,173,425,974,877,065,584,641

9,701,377 to the power 585,934,372,287,882,763,874,941,890,327,750,657

First ten multiples9,701,377, 19,402,754, 29,104,131, 38,805,508, 48,506,885, 58,208,262, 67,909,639, 77,611,016, 87,312,393, 97,013,770

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 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 7

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 77

Collatz (3n + 1) trajectory

Steps to reach 1207the total stopping time

Highest value reached29,104,1323× the starting value

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

First steps9,701,377 → 29,104,132 → 14,552,066 → 7,276,033 → 21,828,100 → 10,914,050 → 5,457,025 → 16,371,076 → 8,185,538 → 4,092,769 → …

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

As a percentage & fraction

As a percentage970,137,700%

9,701,377% as a decimal97,013.77

9,701,377% of 1009,701,377

9,701,377% of 1,00097,013,770

As a fraction of 1009,701,377/100

Read another way

As seconds112 days, 6 hours and 49 minutes

As bytes9.252 MiB

As a 24-bit colour#940801

Keep nerding

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