Recognised as Number
2,535,389
- Positive
- Odd
- Prime
- 7 digits
2,535,389 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,535,389
Digit count7
Digit sum35
Digit product32,400
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,535,389
Distinct prime factors12,535,389
Number of divisors2
Sum of divisors σ(n)2,535,390
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,535,388integers below n that share no factor with it
Carmichael function λ(n)2,535,388the 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,535,3892 in total
Arithmetic
Previous number2,535,388
Next number2,535,390
Double5,070,778
Half1,267,694.5
Square6,428,197,381,321
Cube16,297,980,930,430,068,869
Square root1,592.290488573≈irrational, shown to 9 decimal places
Cube root136.358286107≈
Negation-2,535,389
Reciprocal3.94416794 × 10^-7≈
Representations
Decimal2,535,389
Binary100110101011111101110122 bits
Octal11527735
Hexadecimal26AFDD
Base 361ICBH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, five hundred and thirty-five thousand, three hundred and eighty-nine
Ordinaltwo million, five hundred and thirty-five thousand, three hundred and eighty-ninth
Scientific notation2.535389 × 10^6
Engineering notation2.535389 × 10^6
In other bases
Ternary11202210220022base 3; the most digit-efficient integer base after e: 14 digits
Quinary1122113024base 5; one hand: 10 digits
Septenary30356543base 7: 8 digits
Nonary4683808base 9; each digit is two ternary digits: 7 digits
Duodecimala232a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalfgi99base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:44:16:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT10T110T010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110111111000000101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001101010111111011101
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 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
Bytes326 af dd
Gray code1101011111100000110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001101010111111011101
64-bit0000000000000000000000000000000000000000001001101010111111011101
One's complement11111111110110010101000000100010at 32 bits, every bit flipped
Bits reversed10111011111101010110010000000000at 32 bits
Rotated left by 100000000010011010101111110111010at 32 bits, wrapping
Shifted left by 110011010101111110111010= 5,070,778, no wrap
Shifted right by 1100110101011111101110= 1,267,694, discarding the low bit
These bits as a double1.2526486 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,535,389 to the power 26,428,197,381,321
2,535,389 to the power 316,297,980,930,430,068,869
2,535,389 to the power 441,321,721,573,222,161,879,705,041
2,535,389 to the power 5104,766,638,337,810,163,786,023,484,195,949
First ten multiples2,535,389, 5,070,778, 7,606,167, 10,141,556, 12,676,945, 15,212,334, 17,747,723, 20,283,112, 22,818,501, 25,353,890
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1104the total stopping time
Highest value reached7,606,1683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,535,389 → 7,606,168 → 3,803,084 → 1,901,542 → 950,771 → 2,852,314 → 1,426,157 → 4,278,472 → 2,139,236 → 1,069,618 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage253,538,900%
2,535,389% as a decimal25,353.89
2,535,389% of 1002,535,389
2,535,389% of 1,00025,353,890
As a fraction of 1002,535,389/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,535,389
Nerdulate something else
Nothing in mind? Surprise me · today’s page