Nerdulator> put something in

Recognised as Number

4,676,502

  • Positive
  • Even
  • Composite
  • 7 digits

4,676,502 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,676,502
Digit count7
Digit sum30
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 101 × 7,717
Distinct prime factors42, 3, 101, 7,717
Number of divisors16
Sum of divisors σ(n)9,446,832
Aliquot sum4,770,330sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,543,200integers below n that share no factor with it
Carmichael function λ(n)192,900the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,543,200
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 101, 202, 303, 606, 7,717, 15,434, 23,151, 46,302, 779,417, 1,558,834, 2,338,251, 4,676,50216 in total

Arithmetic

Previous number4,676,501
Next number4,676,503
Double9,353,004
Cube102,273,559,965,094,618,008
Square root2,162.522138615≈irrational, shown to 9 decimal places
Cube root167.227247492≈
Negation-4,676,502
Reciprocal2.13835042 × 10^-7≈

Representations

Decimal4,676,502
Binary1000111010110111001011023 bits
Octal21655626
Hexadecimal475B96
Base 362S8EU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, six hundred and seventy-six thousand, five hundred and two
Ordinalfour million, six hundred and seventy-six thousand, five hundred and second
Scientific notation4.676502 × 10^6
Engineering notation4.676502 × 10^6

In other bases

Ternary22210120221210base 3; the most digit-efficient integer base after e: 14 digits
Quinary2144122002base 5; one hand: 10 digits
Septenary54515055base 7: 8 digits
Nonary8716853base 9; each digit is two ternary digits: 7 digits
Duodecimal1696386base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal194b52base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:39:1:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T11TT100TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110001010110011101010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010001110101101110010110
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 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
Bytes347 5b 96
Gray code11001001111011001011101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010001110101101110010110
64-bit0000000000000000000000000000000000000000010001110101101110010110
One's complement11111111101110001010010001101001at 32 bits, every bit flipped
Bits reversed01101001110110101110001000000000at 32 bits
Rotated left by 100000000100011101011011100101100at 32 bits, wrapping
Shifted left by 1100011101011011100101100= 9,353,004, no wrap
Shifted right by 11000111010110111001011= 2,338,251, discarding the low bit
These bits as a double2.31049898 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,676,537+35
Previous prime4,676,491−11
Distance to nearest prime11
Nearest square below4,674,244
Nearest square above4,678,569

Powers & multiples

4,676,502 to the power 221,869,670,956,004
4,676,502 to the power 3102,273,559,965,094,618,008
4,676,502 to the power 4478,282,507,723,884,911,303,648,016
4,676,502 to the power 52,236,689,103,935,763,235,481,332,554,120,032
First ten multiples4,676,502, 9,353,004, 14,029,506, 18,706,008, 23,382,510, 28,059,012, 32,735,514, 37,412,016, 42,088,518, 46,765,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 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12No, remainder 6
Divisible by 100No, remainder 2

Collatz (3n + 1) trajectory

Steps to reach 1224the total stopping time
Highest value reached18,961,2884× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,676,502 → 2,338,251 → 7,014,754 → 3,507,377 → 10,522,132 → 5,261,066 → 2,630,533 → 7,891,600 → 3,945,800 → 1,972,900 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage467,650,200%
4,676,502% as a decimal46,765.02
4,676,502% of 1004,676,502
4,676,502% of 1,00046,765,020
As a fraction of 1004,676,502/100

Read another way

As bytes4.46 MiB
As a 24-bit colour#475B96

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