Recognised as Number
1,625,021
- Positive
- Odd
- Prime
- 7 digits
1,625,021 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,625,021
Digit count7
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,625,021
Distinct prime factors11,625,021
Number of divisors2
Sum of divisors σ(n)1,625,022
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,625,020integers below n that share no factor with it
Carmichael function λ(n)1,625,020the 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,0212 in total
Arithmetic
Previous number1,625,020
Next number1,625,022
Double3,250,042
Half812,510.5
Square2,640,693,250,441
Cube4,291,181,986,524,884,261
Square root1,274.763115249≈irrational, shown to 9 decimal places
Cube root117.567240825≈
Negation-1,625,021
Reciprocal6.15376663 × 10^-7≈
Representations
Decimal1,625,021
Binary11000110010111011110121 bits
Octal6145675
Hexadecimal18CBBD
Base 36YTVH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and twenty-five thousand and twenty-one
Ordinalone million, six hundred and twenty-five thousand and twenty-first
Scientific notation1.625021 × 10^6
Engineering notation1.625021 × 10^6
In other bases
Ternary10001120002222base 3; the most digit-efficient integer base after e: 14 digits
Quinary404000041base 5; one hand: 9 digits
Septenary16545446base 7: 8 digits
Nonary3046088base 9; each digit is two ternary digits: 7 digits
Duodecimal6644a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala32b1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:31:23:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1001TTT001000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011101110011001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110001100101110111101
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 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 cb bd
Gray code101001010111001100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110001100101110111101
64-bit0000000000000000000000000000000000000000000110001100101110111101
One's complement11111111111001110011010001000010at 32 bits, every bit flipped
Bits reversed10111101110100110001100000000000at 32 bits
Rotated left by 100000000001100011001011101111010at 32 bits, wrapping
Shifted left by 11100011001011101111010= 3,250,042, no wrap
Shifted right by 111000110010111011110= 812,510, discarding the low bit
These bits as a double8.0286705 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,625,021 to the power 22,640,693,250,441
1,625,021 to the power 34,291,181,986,524,884,261
1,625,021 to the power 46,973,260,842,924,653,946,694,481
1,625,021 to the power 511,331,695,308,230,264,081,111,412,209,101
First ten multiples1,625,021, 3,250,042, 4,875,063, 6,500,084, 8,125,105, 9,750,126, 11,375,147, 13,000,168, 14,625,189, 16,250,210
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1251the total stopping time
Highest value reached39,532,69624× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,625,021 → 4,875,064 → 2,437,532 → 1,218,766 → 609,383 → 1,828,150 → 914,075 → 2,742,226 → 1,371,113 → 4,113,340 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage162,502,100%
1,625,021% as a decimal16,250.21
1,625,021% of 1001,625,021
1,625,021% of 1,00016,250,210
As a fraction of 1001,625,021/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,625,021
Nerdulate something else
Nothing in mind? Surprise me · today’s page