Nerdulator> put something in

Recognised as Number

4,804,029

  • Positive
  • Odd
  • Composite
  • 7 digits

4,804,029 is an odd 7-digit integer and a composite number. It has 20 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,804,029
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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^4 × 127 × 467
Distinct prime factors33, 127, 467
Number of divisors20
Sum of divisors σ(n)7,248,384
Aliquot sum2,444,355sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,170,664integers below n that share no factor with it
Carmichael function λ(n)88,074the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,170,664
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 81, 127, 381, 467, 1,143, 1,401, 3,429, 4,203, 10,287, 12,609, 37,827, 59,309, 177,927, 533,781, 1,601,343, 4,804,02920 in total

Arithmetic

Previous number4,804,028
Next number4,804,030
Double9,608,058
Cube110,870,718,298,312,516,389
Square root2,191.809526396≈irrational, shown to 9 decimal places
Cube root168.733716947≈
Negation-4,804,029
Reciprocal2.0815861 × 10^-7≈

Representations

Decimal4,804,029
Binary1001001010011011011110123 bits
Octal22246675
Hexadecimal494DBD
Base 362UYT9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, eight hundred and four thousand and twenty-nine
Ordinalfour million, eight hundred and four thousand and twenty-ninth
Scientific notation4.804029 × 10^6
Engineering notation4.804029 × 10^6

In other bases

Ternary100001001220000base 3; the most digit-efficient integer base after e: 15 digits
Quinary2212212104base 5; one hand: 10 digits
Septenary55555626base 7: 8 digits
Nonary10031800base 9; each digit is two ternary digits: 8 digits
Duodecimal1738139base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1a0a19base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal22:14:27:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10000101T0T0000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110010101001011001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010010010100110110111101
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 odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes349 4d bd
Gray code11011011110101101100011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010010010100110110111101
64-bit0000000000000000000000000000000000000000010010010100110110111101
One's complement11111111101101101011001001000010at 32 bits, every bit flipped
Bits reversed10111101101100101001001000000000at 32 bits
Rotated left by 100000000100100101001101101111010at 32 bits, wrapping
Shifted left by 1100100101001101101111010= 9,608,058, no wrap
Shifted right by 11001001010011011011110= 2,402,014, discarding the low bit
These bits as a double2.37350569 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,804,049+20
Previous prime4,804,027−2
Distance to nearest prime2
Nearest square below4,800,481
Nearest square above4,804,864

Powers & multiples

4,804,029 to the power 223,078,694,632,841
4,804,029 to the power 3110,870,718,298,312,516,389
4,804,029 to the power 4532,626,145,955,923,979,795,731,281
4,804,029 to the power 52,558,751,451,330,491,520,734,107,150,131,149
First ten multiples4,804,029, 9,608,058, 14,412,087, 19,216,116, 24,020,145, 28,824,174, 33,628,203, 38,432,232, 43,236,261, 48,040,290
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 9
Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 192the total stopping time
Highest value reached14,412,0883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,804,029 → 14,412,088 → 7,206,044 → 3,603,022 → 1,801,511 → 5,404,534 → 2,702,267 → 8,106,802 → 4,053,401 → 12,160,204 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage480,402,900%
4,804,029% as a decimal48,040.29
4,804,029% of 1004,804,029
4,804,029% of 1,00048,040,290
As a fraction of 1004,804,029/100

Read another way

As bytes4.581 MiB
As a 24-bit colour#494DBD

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