Nerdulator> put something in

Recognised as Number

8,733,701

  • Positive
  • Odd
  • Prime
  • 7 digits

8,733,701 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value8,733,701
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation8,733,701
Distinct prime factors18,733,701
Number of divisors2
Sum of divisors σ(n)8,733,702
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,733,700integers below n that share no factor with it
Carmichael function λ(n)8,733,700the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 8,733,7012 in total

Arithmetic

Previous number8,733,700
Next number8,733,702
Cube666,185,167,614,326,271,101
Square root2,955.283573534≈irrational, shown to 9 decimal places
Cube root205.936237217≈
Negation-8,733,701
Reciprocal1.14498996 × 10^-7≈

Representations

Decimal8,733,701
Binary10000101010001000000010124 bits
Octal41242005
Hexadecimal854405
Base 36576YT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, seven hundred and thirty-three thousand, seven hundred and one
Ordinaleight million, seven hundred and thirty-three thousand, seven hundred and first
Scientific notation8.733701 × 10^6
Engineering notation8.733701 × 10^6

In other bases

Ternary121102201101102base 3; the most digit-efficient integer base after e: 15 digits
Quinary4213434301base 5; one hand: 10 digits
Septenary134143454base 7: 9 digits
Nonary17381342base 9; each digit is two ternary digits: 8 digits
Duodecimal2b12285base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2ebe51base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal40:26:1:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT1110T0110111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100001010100010000000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100001010100010000000101
Bit length24 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits17within that length
Bit parityodd7 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
Bytes385 44 05
Gray code110001111110011000000111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100001010100010000000101
64-bit0000000000000000000000000000000000000000100001010100010000000101
One's complement11111111011110101011101111111010at 32 bits, every bit flipped
Bits reversed10100000001000101010000100000000at 32 bits
Rotated left by 100000001000010101000100000001010at 32 bits, wrapping
Shifted left by 11000010101000100000001010= 17,467,402, no wrap
Shifted right by 110000101010001000000010= 4,366,850, discarding the low bit
These bits as a double4.31502163 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime8,733,707+6
Previous prime8,733,691−10
Distance to nearest prime0, it is prime
Nearest square below8,732,025
Nearest square above8,737,936

Powers & multiples

8,733,701 to the power 276,277,533,157,401
8,733,701 to the power 3666,185,167,614,326,271,101
8,733,701 to the power 45,818,262,064,578,408,968,241,074,801
8,733,701 to the power 550,814,961,211,670,514,984,336,043,230,568,501
First ten multiples8,733,701, 17,467,402, 26,201,103, 34,934,804, 43,668,505, 52,402,206, 61,135,907, 69,869,608, 78,603,309, 87,337,010
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 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1119the total stopping time
Highest value reached26,201,1043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,733,701 → 26,201,104 → 13,100,552 → 6,550,276 → 3,275,138 → 1,637,569 → 4,912,708 → 2,456,354 → 1,228,177 → 3,684,532 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage873,370,100%
8,733,701% as a decimal87,337.01
8,733,701% of 1008,733,701
8,733,701% of 1,00087,337,010
As a fraction of 1008,733,701/100

Read another way

As bytes8.329 MiB
As a 24-bit colour#854405

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “8733701” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.