Nerdulator> put something in

Recognised as Number

5,100,671

  • Positive
  • Odd
  • Prime
  • 7 digits

5,100,671 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,100,671
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5,100,671
Distinct prime factors15,100,671
Number of divisors2
Sum of divisors σ(n)5,100,672
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,100,670integers below n that share no factor with it
Carmichael function λ(n)5,100,670the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5,100,6712 in total

Arithmetic

Previous number5,100,670
Next number5,100,672
Cube132,703,365,018,989,411,711
Square root2,258.466515138≈irrational, shown to 9 decimal places
Cube root172.137610714≈
Negation-5,100,671
Reciprocal1.96052637 × 10^-7≈

Representations

Decimal5,100,671
Binary1001101110101000111111123 bits
Octal23352177
Hexadecimal4DD47F
Base 3631BPB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, one hundred thousand, six hundred and seventy-one
Ordinalfive million, one hundred thousand, six hundred and seventy-first
Scientific notation5.100671 × 10^6
Engineering notation5.100671 × 10^6

In other bases

Ternary100121010210202base 3; the most digit-efficient integer base after e: 15 digits
Quinary2301210141base 5; one hand: 10 digits
Septenary61232522base 7: 8 digits
Nonary10533722base 9; each digit is two ternary digits: 8 digits
Duodecimal185b93bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1bhbdbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal23:36:51:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101TT1011T11T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100101101010110000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010011011101010001111111
Bit length23 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits8within that length
Bit parityodd15 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
Bytes34d d4 7f
Gray code11010110011111001000000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010011011101010001111111
64-bit0000000000000000000000000000000000000000010011011101010001111111
One's complement11111111101100100010101110000000at 32 bits, every bit flipped
Bits reversed11111110001010111011001000000000at 32 bits
Rotated left by 100000000100110111010100011111110at 32 bits, wrapping
Shifted left by 1100110111010100011111110= 10,201,342, no wrap
Shifted right by 11001101110101000111111= 2,550,335, discarding the low bit
These bits as a double2.52006631 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,100,673+2
Previous prime5,100,661−10
Distance to nearest prime0, it is prime
Nearest square below5,098,564
Nearest square above5,103,081

Powers & multiples

5,100,671 to the power 226,016,844,650,241
5,100,671 to the power 3132,703,365,018,989,411,711
5,100,671 to the power 4676,876,205,554,773,741,621,358,081
5,100,671 to the power 53,452,522,832,263,273,335,449,554,144,372,351
First ten multiples5,100,671, 10,201,342, 15,302,013, 20,402,684, 25,503,355, 30,604,026, 35,704,697, 40,805,368, 45,906,039, 51,006,710
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1175the total stopping time
Highest value reached174,299,52434× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,100,671 → 15,302,014 → 7,651,007 → 22,953,022 → 11,476,511 → 34,429,534 → 17,214,767 → 51,644,302 → 25,822,151 → 77,466,454 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage510,067,100%
5,100,671% as a decimal51,006.71
5,100,671% of 1005,100,671
5,100,671% of 1,00051,006,710
As a fraction of 1005,100,671/100

Read another way

As bytes4.864 MiB
As a 24-bit colour#4DD47F

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