Recognised as Number

7,469,682

Positive
Even
Composite
7 digits

7,469,682 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value7,469,682

Digit count7

Digit sum42

Digit product145,152

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 11 × 113,177

Distinct prime factors42, 3, 11, 113,177

Number of divisors16

Sum of divisors σ(n)16,297,632

Aliquot sum8,827,950sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)2,263,520integers below n that share no factor with it

Carmichael function λ(n)565,880the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,263,520

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 11, 22, 33, 66, 113,177, 226,354, 339,531, 679,062, 1,244,947, 2,489,894, 3,734,841, 7,469,68216 in total

Arithmetic

Previous number7,469,681

Next number7,469,683

Double14,939,364

Half3,734,841

Square55,796,149,181,124

Cube416,779,491,207,556,682,568

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

Cube root195.479268171≈

Negation-7,469,682

Reciprocal1.33874508 × 10^-7≈

Representations

Decimal7,469,682

Binary1110001111110100111001023 bits

Octal34375162

Hexadecimal71FA72

Base 364G3N6

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

In wordsseven million, four hundred and sixty-nine thousand, six hundred and eighty-two

Ordinalseven million, four hundred and sixty-nine thousand, six hundred and eighty-second

Scientific notation7.469682 × 10^6

Engineering notation7.469682 × 10^6

In other bases

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

Quinary3403012212base 5; one hand: 10 digits

Septenary120330333base 7: 9 digits

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

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

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

Sexagesimal34:34:54:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000011100011111101001110010

Bit length23 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits9within that length

Bit parityeven14 set bits, so even; 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

Bytes371 fa 72

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

At each machine width

32-bit00000000011100011111101001110010

64-bit0000000000000000000000000000000000000000011100011111101001110010

One's complement11111111100011100000010110001101at 32 bits, every bit flipped

Bits reversed01001110010111111000111000000000at 32 bits

Rotated left by 100000000111000111111010011100100at 32 bits, wrapping

Shifted left by 1111000111111010011100100= 14,939,364, no wrap

Shifted right by 11110001111110100111001= 3,734,841, discarding the low bit

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

Nearest landmarks

Next prime7,469,699+17

Previous prime7,469,669−13

Distance to nearest prime13

Nearest square below7,469,289

Nearest square above7,474,756

Powers & multiples

7,469,682 to the power 255,796,149,181,124

7,469,682 to the power 3416,779,491,207,556,682,568

7,469,682 to the power 43,113,210,263,442,244,415,757,903,376

7,469,682 to the power 523,254,690,667,049,791,151,987,327,205,446,432

First ten multiples7,469,682, 14,939,364, 22,409,046, 29,878,728, 37,348,410, 44,818,092, 52,287,774, 59,757,456, 67,227,138, 74,696,820

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 3

Divisible by 8No, remainder 2

Divisible by 9No, remainder 6

Divisible by 10No, remainder 2

Divisible by 11Yes

Divisible by 12No, remainder 6

Divisible by 100No, remainder 82

Collatz (3n + 1) trajectory

Steps to reach 1160the total stopping time

Highest value reached53,842,4807× the starting value

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

First steps7,469,682 → 3,734,841 → 11,204,524 → 5,602,262 → 2,801,131 → 8,403,394 → 4,201,697 → 12,605,092 → 6,302,546 → 3,151,273 → …

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

As a percentage & fraction

As a percentage746,968,200%

7,469,682% as a decimal74,696.82

7,469,682% of 1007,469,682

7,469,682% of 1,00074,696,820

As a fraction of 1007,469,682/100

Read another way

As seconds86 days, 10 hours and 54 minutes

As bytes7.124 MiB

As a 24-bit colour#71FA72

Keep nerding

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