Recognised as Number
2,575,421
- Positive
- Odd
- Prime
- 7 digits
2,575,421 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 value2,575,421
Digit count7
Digit sum26
Digit product2,800
Multiplicative persistence2times 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 factorisation2,575,421
Distinct prime factors12,575,421
Number of divisors2
Sum of divisors σ(n)2,575,422
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,575,420integers below n that share no factor with it
Carmichael function λ(n)2,575,420the 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, 2,575,4212 in total
Arithmetic
Previous number2,575,420
Next number2,575,422
Double5,150,842
Half1,287,710.5
Square6,632,793,327,241
Cube17,082,235,223,636,343,461
Square root1,604.811826975≈irrational, shown to 9 decimal places
Cube root137.072208724≈
Negation-2,575,421
Reciprocal3.88286032 × 10^-7≈
Representations
Decimal2,575,421
Binary100111010011000011110122 bits
Octal11646075
Hexadecimal274C3D
Base 361J77H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, five hundred and seventy-five thousand, four hundred and twenty-one
Ordinaltwo million, five hundred and seventy-five thousand, four hundred and twenty-first
Scientific notation2.575421 × 10^6
Engineering notation2.575421 × 10^6
In other bases
Ternary11211211210222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1124403141base 5; one hand: 10 digits
Septenary30614342base 7: 8 digits
Nonary4754728base 9; each digit is two ternary digits: 7 digits
Duodecimala424a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalg1ib1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:55:23:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT0TT0TTT1100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110110101110001001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001110100110000111101
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; 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
Bytes327 4c 3d
Gray code1101001110101000100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001110100110000111101
64-bit0000000000000000000000000000000000000000001001110100110000111101
One's complement11111111110110001011001111000010at 32 bits, every bit flipped
Bits reversed10111100001100101110010000000000at 32 bits
Rotated left by 100000000010011101001100001111010at 32 bits, wrapping
Shifted left by 110011101001100001111010= 5,150,842, no wrap
Shifted right by 1100111010011000011110= 1,287,710, discarding the low bit
These bits as a double1.27242704 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,575,421 to the power 26,632,793,327,241
2,575,421 to the power 317,082,235,223,636,343,461
2,575,421 to the power 443,993,947,321,892,735,312,672,081
2,575,421 to the power 5113,302,935,805,696,310,271,697,243,521,101
First ten multiples2,575,421, 5,150,842, 7,726,263, 10,301,684, 12,877,105, 15,452,526, 18,027,947, 20,603,368, 23,178,789, 25,754,210
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
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 1156the total stopping time
Highest value reached7,726,2643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,575,421 → 7,726,264 → 3,863,132 → 1,931,566 → 965,783 → 2,897,350 → 1,448,675 → 4,346,026 → 2,173,013 → 6,519,040 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage257,542,100%
2,575,421% as a decimal25,754.21
2,575,421% of 1002,575,421
2,575,421% of 1,00025,754,210
As a fraction of 1002,575,421/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 2,575,421
Nerdulate something else
Nothing in mind? Surprise me · today’s page