Nerdulator> put something in

Recognised as Number

5,100,673

  • Positive
  • Odd
  • Prime
  • 7 digits

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

Number properties

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

Factors & divisors

Prime factorisation5,100,673
Distinct prime factors15,100,673
Number of divisors2
Sum of divisors σ(n)5,100,674
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,100,672integers below n that share no factor with it
Carmichael function λ(n)5,100,672the 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,6732 in total

Arithmetic

Previous number5,100,672
Next number5,100,674
Cube132,703,521,120,118,521,217
Square root2,258.466957916≈irrational, shown to 9 decimal places
Cube root172.137633212≈
Negation-5,100,673
Reciprocal1.9605256 × 10^-7≈

Representations

Decimal5,100,673
Binary1001101110101001000000123 bits
Octal23352201
Hexadecimal4DD481
Base 3631BPD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, one hundred thousand, six hundred and seventy-three
Ordinalfive million, one hundred thousand, six hundred and seventy-third
Scientific notation5.100673 × 10^6
Engineering notation5.100673 × 10^6

In other bases

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

Bit-level

00000000010011011101010010000001
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; 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 81
Gray code11010110011111011000001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010011011101010010000001
64-bit0000000000000000000000000000000000000000010011011101010010000001
One's complement11111111101100100010101101111110at 32 bits, every bit flipped
Bits reversed10000001001010111011001000000000at 32 bits
Rotated left by 100000000100110111010100100000010at 32 bits, wrapping
Shifted left by 1100110111010100100000010= 10,201,346, no wrap
Shifted right by 11001101110101001000000= 2,550,336, discarding the low bit
These bits as a double2.5200673 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,100,691+18
Previous prime5,100,671−2
Distance to nearest prime0, it is prime
Nearest square below5,098,564
Nearest square above5,103,081

Powers & multiples

5,100,673 to the power 226,016,865,052,929
5,100,673 to the power 3132,703,521,120,118,521,217
5,100,673 to the power 4676,877,267,182,318,297,971,479,041
5,100,673 to the power 53,452,529,601,030,637,019,869,077,914,494,593
First ten multiples5,100,673, 10,201,346, 15,302,019, 20,402,692, 25,503,365, 30,604,038, 35,704,711, 40,805,384, 45,906,057, 51,006,730
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 1188the total stopping time
Highest value reached33,127,1086× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,100,673 → 15,302,020 → 7,651,010 → 3,825,505 → 11,476,516 → 5,738,258 → 2,869,129 → 8,607,388 → 4,303,694 → 2,151,847 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage510,067,300%
5,100,673% as a decimal51,006.73
5,100,673% of 1005,100,673
5,100,673% of 1,00051,006,730
As a fraction of 1005,100,673/100

Read another way

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

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