Recognised as Number

5,167,670

Positive
Even
Composite
7 digits

5,167,670 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value5,167,670

Digit count7

Digit sum32

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 73 × 7,079

Distinct prime factors42, 5, 73, 7,079

Number of divisors16

Sum of divisors σ(n)9,430,560

Aliquot sum4,262,890sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,038,464integers below n that share no factor with it

Carmichael function λ(n)254,808the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,038,464

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 73, 146, 365, 730, 7,079, 14,158, 35,395, 70,790, 516,767, 1,033,534, 2,583,835, 5,167,67016 in total

Arithmetic

Previous number5,167,669

Next number5,167,671

Double10,335,340

Half2,583,835

Square26,704,813,228,900

Cube138,001,662,178,589,663,000

Square root2,273.250976025≈irrational, shown to 9 decimal places

Cube root172.888029386≈

Negation-5,167,670

Reciprocal1.93510809 × 10^-7≈

Representations

Decimal5,167,670

Binary1001110110110100011011023 bits

Octal23555066

Hexadecimal4EDA36

Base 3632REE

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsfive million, one hundred and sixty-seven thousand, six hundred and seventy

Ordinalfive million, one hundred and sixty-seven thousand, six hundred and seventieth

Scientific notation5.16767 × 10^6

Engineering notation5.16767 × 10^6

In other bases

Ternary100201112201012base 3; the most digit-efficient integer base after e: 15 digits

Quinary2310331140base 5; one hand: 10 digits

Septenary61632044base 7: 8 digits

Nonary10645635base 9; each digit is two ternary digits: 8 digits

Duodecimal1892672base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal1c5j3abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal23:55:27:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary101T1TTT0T011TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10100110010111001001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010011101101101000110110

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 even

Highest set bitbit 22worth 4,194,304

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes34e da 36

Gray code11010011011011100101101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010011101101101000110110

64-bit0000000000000000000000000000000000000000010011101101101000110110

One's complement11111111101100010010010111001001at 32 bits, every bit flipped

Bits reversed01101100010110110111001000000000at 32 bits

Rotated left by 100000000100111011011010001101100at 32 bits, wrapping

Shifted left by 1100111011011010001101100= 10,335,340, no wrap

Shifted right by 11001110110110100011011= 2,583,835, discarding the low bit

These bits as a double2.55316822 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,167,691+21

Previous prime5,167,667−3

Distance to nearest prime3

Nearest square below5,166,529

Nearest square above5,171,076

Powers & multiples

5,167,670 to the power 226,704,813,228,900

5,167,670 to the power 3138,001,662,178,589,663,000

5,167,670 to the power 4713,147,049,590,432,443,795,210,000

5,167,670 to the power 53,685,308,613,756,990,026,827,192,860,700,000

First ten multiples5,167,670, 10,335,340, 15,503,010, 20,670,680, 25,838,350, 31,006,020, 36,173,690, 41,341,360, 46,509,030, 51,676,700

Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 4

Divisible by 8No, remainder 6

Divisible by 9No, remainder 5

Divisible by 10Yes

Divisible by 11No, remainder 2

Divisible by 12No, remainder 2

Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 1250the total stopping time

Highest value reached66,220,90012× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps5,167,670 → 2,583,835 → 7,751,506 → 3,875,753 → 11,627,260 → 5,813,630 → 2,906,815 → 8,720,446 → 4,360,223 → 13,080,670 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage516,767,000%

5,167,670% as a decimal51,676.7

5,167,670% of 1005,167,670

5,167,670% of 1,00051,676,700

As a fraction of 1005,167,670/100

Read another way

As seconds59 days, 19 hours and 27 minutes

As bytes4.928 MiB

As a 24-bit colour#4EDA36

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.