Recognised as Number

1,600,031

Positive
Odd
Composite
7 digits

1,600,031 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,600,031

Digit count7

Digit sum11

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 factorisation647 × 2,473

Distinct prime factors2647, 2,473

Number of divisors4

Sum of divisors σ(n)1,603,152

Aliquot sum3,121sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,596,912integers below n that share no factor with it

Carmichael function λ(n)798,456the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,596,912

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

SquarefreeYesno repeated prime factor

All divisors1, 647, 2,473, 1,600,0314 in total

Arithmetic

Previous number1,600,030

Next number1,600,032

Double3,200,062

Half800,015.5

Square2,560,099,200,961

Cube4,096,238,084,612,829,791

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

Cube root116.961464895≈

Negation-1,600,031

Reciprocal6.24987891 × 10^-7≈

Representations

Decimal1,600,031

Binary11000011010100001111121 bits

Octal6065037

Hexadecimal186A1F

Base 36YALB

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

In wordsone million, six hundred thousand and thirty-one

Ordinalone million, six hundred thousand and thirty-first

Scientific notation1.600031 × 10^6

Engineering notation1.600031 × 10^6

In other bases

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

Quinary402200111base 5; one hand: 9 digits

Septenary16412546base 7: 8 digits

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

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

Vigesimala001bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal7:24:27:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110000110101000011111

Bit length21 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits10within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes318 6a 1f

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

At each machine width

32-bit00000000000110000110101000011111

64-bit0000000000000000000000000000000000000000000110000110101000011111

One's complement11111111111001111001010111100000at 32 bits, every bit flipped

Bits reversed11111000010101100001100000000000at 32 bits

Rotated left by 100000000001100001101010000111110at 32 bits, wrapping

Shifted left by 11100001101010000111110= 3,200,062, no wrap

Shifted right by 111000011010100001111= 800,015, discarding the low bit

These bits as a double7.90520349 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,600,033+2

Previous prime1,599,977−54

Distance to nearest prime2

Nearest square below1,597,696

Nearest square above1,600,225

Powers & multiples

1,600,031 to the power 22,560,099,200,961

1,600,031 to the power 34,096,238,084,612,829,791

1,600,031 to the power 46,554,107,918,761,150,663,323,521

1,600,031 to the power 510,486,775,847,363,322,656,988,196,629,151

First ten multiples1,600,031, 3,200,062, 4,800,093, 6,400,124, 8,000,155, 9,600,186, 11,200,217, 12,800,248, 14,400,279, 16,000,310

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

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 6

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 31

Collatz (3n + 1) trajectory

Steps to reach 1238the total stopping time

Highest value reached24,300,48415× the starting value

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

First steps1,600,031 → 4,800,094 → 2,400,047 → 7,200,142 → 3,600,071 → 10,800,214 → 5,400,107 → 16,200,322 → 8,100,161 → 24,300,484 → …

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

As a percentage & fraction

As a percentage160,003,100%

1,600,031% as a decimal16,000.31

1,600,031% of 1001,600,031

1,600,031% of 1,00016,000,310

As a fraction of 1001,600,031/100

Read another way

As seconds18 days, 12 hours and 27 minutes

As bytes1.526 MiB

As a 24-bit colour#186A1F

Keep nerding

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