Nerdulator> put something in

Recognised as Number

4,473,987

  • Positive
  • Odd
  • Composite
  • 7 digits

4,473,987 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,473,987
Digit count7
Digit sum42
Digit product169,344
Multiplicative persistence4times 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 factorisation3 × 7 × 19 × 11,213
Distinct prime factors43, 7, 19, 11,213
Number of divisors16
Sum of divisors σ(n)7,176,960
Aliquot sum2,702,973sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,421,792integers below n that share no factor with it
Carmichael function λ(n)100,908the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,421,792
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 19, 21, 57, 133, 399, 11,213, 33,639, 78,491, 213,047, 235,473, 639,141, 1,491,329, 4,473,98716 in total

Arithmetic

Previous number4,473,986
Next number4,473,988
Double8,947,974
Cube89,553,827,775,904,315,803
Square root2,115.180134173≈irrational, shown to 9 decimal places
Cube root164.777625136≈
Negation-4,473,987
Reciprocal2.23514284 × 10^-7≈

Representations

Decimal4,473,987
Binary1000100010001001000001123 bits
Octal21042203
Hexadecimal444483
Base 362NW5F
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, four hundred and seventy-three thousand, nine hundred and eighty-seven
Ordinalfour million, four hundred and seventy-three thousand, nine hundred and eighty-seventh
Scientific notation4.473987 × 10^6
Engineering notation4.473987 × 10^6

In other bases

Ternary22102022011020base 3; the most digit-efficient integer base after e: 14 digits
Quinary2121131422base 5; one hand: 10 digits
Septenary53012460base 7: 8 digits
Nonary8368136base 9; each digit is two ternary digits: 7 digits
Duodecimal15b9143base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal17j4j7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:42:46:27base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T11T10T0111T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001000100010110000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010001000100010010000011
Bit length23 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits16within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes344 44 83
Gray code11001100110011011000010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010001000100010010000011
64-bit0000000000000000000000000000000000000000010001000100010010000011
One's complement11111111101110111011101101111100at 32 bits, every bit flipped
Bits reversed11000001001000100010001000000000at 32 bits
Rotated left by 100000000100010001000100100000110at 32 bits, wrapping
Shifted left by 1100010001000100100000110= 8,947,974, no wrap
Shifted right by 11000100010001001000001= 2,236,993, discarding the low bit
These bits as a double2.21044328 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,474,027+40
Previous prime4,473,971−16
Distance to nearest prime16
Nearest square below4,473,225
Nearest square above4,477,456

Powers & multiples

4,473,987 to the power 220,016,559,676,169
4,473,987 to the power 389,553,827,775,904,315,803
4,473,987 to the power 4400,662,661,269,634,822,146,516,561
4,473,987 to the power 51,792,559,537,905,749,689,030,827,189,198,707
First ten multiples4,473,987, 8,947,974, 13,421,961, 17,895,948, 22,369,935, 26,843,922, 31,317,909, 35,791,896, 40,265,883, 44,739,870
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1149the total stopping time
Highest value reached20,132,9444× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,473,987 → 13,421,962 → 6,710,981 → 20,132,944 → 10,066,472 → 5,033,236 → 2,516,618 → 1,258,309 → 3,774,928 → 1,887,464 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage447,398,700%
4,473,987% as a decimal44,739.87
4,473,987% of 1004,473,987
4,473,987% of 1,00044,739,870
As a fraction of 1004,473,987/100

Read another way

As bytes4.267 MiB
As a 24-bit colour#444483

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