Recognised as Number

1,625,017

Positive
Odd
Prime
7 digits

1,625,017 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 value1,625,017

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 factorisation1,625,017

Distinct prime factors11,625,017

Number of divisors2

Sum of divisors σ(n)1,625,018

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,625,016the 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, 1,625,0172 in total

Arithmetic

Previous number1,625,016

Next number1,625,018

Double3,250,034

Half812,508.5

Square2,640,680,250,289

Cube4,291,150,298,283,879,913

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

Cube root117.567144361≈

Negation-1,625,017

Reciprocal6.15378178 × 10^-7≈

Representations

Decimal1,625,017

Binary11000110010111011100121 bits

Octal6145671

Hexadecimal18CBB9

Base 36YTVD

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

In wordsone million, six hundred and twenty-five thousand and seventeen

Ordinalone million, six hundred and twenty-five thousand and seventeenth

Scientific notation1.625017 × 10^6

Engineering notation1.625017 × 10^6

In other bases

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

Quinary404000032base 5; one hand: 9 digits

Septenary16545442base 7: 8 digits

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

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

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

Sexagesimal7:31:23:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110001100101110111001

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

Bit parityeven12 set bits, so even; 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 cb b9

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

At each machine width

32-bit00000000000110001100101110111001

64-bit0000000000000000000000000000000000000000000110001100101110111001

One's complement11111111111001110011010001000110at 32 bits, every bit flipped

Bits reversed10011101110100110001100000000000at 32 bits

Rotated left by 100000000001100011001011101110010at 32 bits, wrapping

Shifted left by 11100011001011101110010= 3,250,034, no wrap

Shifted right by 111000110010111011100= 812,508, discarding the low bit

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

Nearest landmarks

Next prime1,625,021+4

Previous prime1,624,993−24

Distance to nearest prime0, it is prime

Nearest square below1,623,076

Nearest square above1,625,625

Powers & multiples

1,625,017 to the power 22,640,680,250,289

1,625,017 to the power 34,291,150,298,283,879,913

1,625,017 to the power 46,973,192,184,266,375,684,583,521

1,625,017 to the power 511,331,555,843,699,993,015,834,859,544,857

First ten multiples1,625,017, 3,250,034, 4,875,051, 6,500,068, 8,125,085, 9,750,102, 11,375,119, 13,000,136, 14,625,153, 16,250,170

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 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 7

Divisible by 11No, remainder 9

Divisible by 12No, remainder 1

Divisible by 100No, remainder 17

Collatz (3n + 1) trajectory

Steps to reach 1207the total stopping time

Highest value reached5,484,4363× the starting value

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

First steps1,625,017 → 4,875,052 → 2,437,526 → 1,218,763 → 3,656,290 → 1,828,145 → 5,484,436 → 2,742,218 → 1,371,109 → 4,113,328 → …

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

As a percentage & fraction

As a percentage162,501,700%

1,625,017% as a decimal16,250.17

1,625,017% of 1001,625,017

1,625,017% of 1,00016,250,170

As a fraction of 1001,625,017/100

Read another way

As seconds18 days, 19 hours and 23 minutes

As bytes1.55 MiB

As a 24-bit colour#18CBB9

Keep nerding

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