Nerdulator> put something in

Recognised as Number

8,064,702

  • Positive
  • Even
  • Composite
  • 7 digits

8,064,702 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value8,064,702
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 factorisation2 × 3^2 × 19 × 23,581
Distinct prime factors42, 3, 19, 23,581
Number of divisors24
Sum of divisors σ(n)18,393,960
Aliquot sum10,329,258sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)2,546,640integers below n that share no factor with it
Carmichael function λ(n)23,580the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,546,640
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 19, 38, 57, 114, 171, 342, 23,581, 47,162, 70,743, 141,486, 212,229, 424,458, 448,039, 896,078, 1,344,117, 2,688,234, 4,032,351, 8,064,70224 in total

Arithmetic

Previous number8,064,701
Next number8,064,703
Cube524,523,527,236,436,316,408
Square root2,839.841897008≈irrational, shown to 9 decimal places
Cube root200.537736236≈
Negation-8,064,702
Reciprocal1.23997142 × 10^-7≈

Representations

Decimal8,064,702
Binary1111011000011101011111023 bits
Octal36607276
Hexadecimal7B0EBE
Base 364SURI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight million, sixty-four thousand, seven hundred and two
Ordinaleight million, sixty-four thousand, seven hundred and second
Scientific notation8.064702 × 10^6
Engineering notation8.064702 × 10^6

In other bases

Ternary120011201200200base 3; the most digit-efficient integer base after e: 15 digits
Quinary4031032302base 5; one hand: 10 digits
Septenary125356152base 7: 9 digits
Nonary16151620base 9; each digit is two ternary digits: 8 digits
Duodecimal284b0a6base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2a81f2base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal37:20:11:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT01TTT1TT01T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100011110001001111000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000011110110000111010111110
Bit length23 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits8within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being even
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes37b 0e be
Gray code10001101000100111100001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000011110110000111010111110
64-bit0000000000000000000000000000000000000000011110110000111010111110
One's complement11111111100001001111000101000001at 32 bits, every bit flipped
Bits reversed01111101011100001101111000000000at 32 bits
Rotated left by 100000000111101100001110101111100at 32 bits, wrapping
Shifted left by 1111101100001110101111100= 16,129,404, no wrap
Shifted right by 11111011000011101011111= 4,032,351, discarding the low bit
These bits as a double3.9844922 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime8,064,713+11
Previous prime8,064,701−1
Distance to nearest prime1
Nearest square below8,059,921
Nearest square above8,065,600

Powers & multiples

8,064,702 to the power 265,039,418,348,804
8,064,702 to the power 3524,523,527,236,436,316,408
8,064,702 to the power 44,230,125,939,150,742,433,808,230,416
8,064,702 to the power 534,114,705,121,720,870,807,418,103,452,376,032
First ten multiples8,064,702, 16,129,404, 24,194,106, 32,258,808, 40,323,510, 48,388,212, 56,452,914, 64,517,616, 72,582,318, 80,647,020
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 6
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 8
Divisible by 12No, remainder 6
Divisible by 100No, remainder 2

Collatz (3n + 1) trajectory

Steps to reach 193the total stopping time
Highest value reached61,241,3447× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps8,064,702 → 4,032,351 → 12,097,054 → 6,048,527 → 18,145,582 → 9,072,791 → 27,218,374 → 13,609,187 → 40,827,562 → 20,413,781 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage806,470,200%
8,064,702% as a decimal80,647.02
8,064,702% of 1008,064,702
8,064,702% of 1,00080,647,020
As a fraction of 1008,064,702/100

Read another way

As bytes7.691 MiB
As a 24-bit colour#7B0EBE

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 “8064702” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.