Recognised as Number

3,950,713

Positive
Odd
Composite
7 digits

3,950,713 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value3,950,713

Digit count7

Digit sum28

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation13^2 × 97 × 241

Distinct prime factors313, 97, 241

Number of divisors12

Sum of divisors σ(n)4,340,028

Aliquot sum389,315sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)3,594,240integers below n that share no factor with it

Carmichael function λ(n)6,240the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,594,240

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 13, 97, 169, 241, 1,261, 3,133, 16,393, 23,377, 40,729, 303,901, 3,950,71312 in total

Arithmetic

Previous number3,950,712

Next number3,950,714

Double7,901,426

Half1,975,356.5

Square15,608,133,208,369

Cube61,663,254,772,035,117,097

Square root1,987.640057958≈irrational, shown to 9 decimal places

Cube root158.08542355≈

Negation-3,950,713

Reciprocal2.53118867 × 10^-7≈

Representations

Decimal3,950,713

Binary111100010010000111100122 bits

Octal17044171

Hexadecimal3C4879

Base 362COE1

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

In wordsthree million, nine hundred and fifty thousand, seven hundred and thirteen

Ordinalthree million, nine hundred and fifty thousand, seven hundred and thirteenth

Scientific notation3.950713 × 10^6

Engineering notation3.950713 × 10^6

In other bases

Ternary21102201100201base 3; the most digit-efficient integer base after e: 14 digits

Quinary2002410323base 5; one hand: 10 digits

Septenary45403054base 7: 8 digits

Nonary7381321base 9; each digit is two ternary digits: 7 digits

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

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

Sexagesimal18:17:25:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001111000100100001111001

Bit length22 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits11within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes33c 48 79

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

At each machine width

32-bit00000000001111000100100001111001

64-bit0000000000000000000000000000000000000000001111000100100001111001

One's complement11111111110000111011011110000110at 32 bits, every bit flipped

Bits reversed10011110000100100011110000000000at 32 bits

Rotated left by 100000000011110001001000011110010at 32 bits, wrapping

Shifted left by 111110001001000011110010= 7,901,426, no wrap

Shifted right by 1111100010010000111100= 1,975,356, discarding the low bit

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

Nearest landmarks

Next prime3,950,731+18

Previous prime3,950,701−12

Distance to nearest prime12

Nearest square below3,948,169

Nearest square above3,952,144

Powers & multiples

3,950,713 to the power 215,608,133,208,369

3,950,713 to the power 361,663,254,772,035,117,097

3,950,713 to the power 4243,613,822,250,191,173,571,640,161

3,950,713 to the power 5962,448,294,543,519,521,914,735,215,384,793

First ten multiples3,950,713, 7,901,426, 11,852,139, 15,802,852, 19,753,565, 23,704,278, 27,654,991, 31,605,704, 35,556,417, 39,507,130

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

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 1

Divisible by 10No, remainder 3

Divisible by 11No, remainder 8

Divisible by 12No, remainder 1

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1172the total stopping time

Highest value reached25,313,1286× the starting value

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

First steps3,950,713 → 11,852,140 → 5,926,070 → 2,963,035 → 8,889,106 → 4,444,553 → 13,333,660 → 6,666,830 → 3,333,415 → 10,000,246 → …

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

As a percentage & fraction

As a percentage395,071,300%

3,950,713% as a decimal39,507.13

3,950,713% of 1003,950,713

3,950,713% of 1,00039,507,130

As a fraction of 1003,950,713/100

Read another way

As seconds45 days, 17 hours and 25 minutes

As bytes3.768 MiB

As a 24-bit colour#3C4879

Keep nerding

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