Nerdulator> put something in

Recognised as Number

5,000,421

  • Positive
  • Odd
  • Composite
  • 7 digits

5,000,421 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value5,000,421
Digit count7
Digit sum12
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 factorisation3 × 1,666,807
Distinct prime factors23, 1,666,807
Number of divisors4
Sum of divisors σ(n)6,667,232
Aliquot sum1,666,811sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,333,612integers below n that share no factor with it
Carmichael function λ(n)1,666,806the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,333,612
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 1,666,807, 5,000,4214 in total

Arithmetic

Previous number5,000,420
Next number5,000,422
Cube125,031,577,658,689,618,461
Square root2,236.16211398≈irrational, shown to 9 decimal places
Cube root171.002393865≈
Negation-5,000,421
Reciprocal1.99983161 × 10^-7≈

Representations

Decimal5,000,421
Binary1001100010011001110010123 bits
Octal23046345
Hexadecimal4C4CE5
Base 362Z6CL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, four hundred and twenty-one
Ordinalfive million, four hundred and twenty-first
Scientific notation5.000421 × 10^6
Engineering notation5.000421 × 10^6

In other bases

Ternary100102001021210base 3; the most digit-efficient integer base after e: 15 digits
Quinary2240003141base 5; one hand: 10 digits
Septenary60334326base 7: 8 digits
Nonary10361253base 9; each digit is two ternary digits: 8 digits
Duodecimal1811919base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1b5111base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:9:0:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10011T00110TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111000101110100100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010011000100110011100101
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 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
Bytes34c 4c e5
Gray code11010100110101010010111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010011000100110011100101
64-bit0000000000000000000000000000000000000000010011000100110011100101
One's complement11111111101100111011001100011010at 32 bits, every bit flipped
Bits reversed10100111001100100011001000000000at 32 bits
Rotated left by 100000000100110001001100111001010at 32 bits, wrapping
Shifted left by 1100110001001100111001010= 10,000,842, no wrap
Shifted right by 11001100010011001110010= 2,500,210, discarding the low bit
These bits as a double2.47053623 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,000,423+2
Previous prime5,000,399−22
Distance to nearest prime2
Nearest square below4,999,696
Nearest square above5,004,169

Powers & multiples

5,000,421 to the power 225,004,210,177,241
5,000,421 to the power 3125,031,577,658,689,618,461
5,000,421 to the power 4625,210,526,587,642,400,634,372,081
5,000,421 to the power 53,126,315,846,569,905,400,622,527,475,646,101
First ten multiples5,000,421, 10,000,842, 15,001,263, 20,001,684, 25,002,105, 30,002,526, 35,002,947, 40,003,368, 45,003,789, 50,004,210
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 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21

Collatz (3n + 1) trajectory

Steps to reach 1113the total stopping time
Highest value reached15,001,2643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,000,421 → 15,001,264 → 7,500,632 → 3,750,316 → 1,875,158 → 937,579 → 2,812,738 → 1,406,369 → 4,219,108 → 2,109,554 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage500,042,100%
5,000,421% as a decimal50,004.21
5,000,421% of 1005,000,421
5,000,421% of 1,00050,004,210
As a fraction of 1005,000,421/100

Read another way

As bytes4.769 MiB
As a 24-bit colour#4C4CE5

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