Recognised as Number
2,632,477
- Positive
- Odd
- Prime
- 7 digits
2,632,477 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 value2,632,477
Digit count7
Digit sum31
Digit product14,112
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,632,477
Distinct prime factors12,632,477
Number of divisors2
Sum of divisors σ(n)2,632,478
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,632,476integers below n that share no factor with it
Carmichael function λ(n)2,632,476the 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,632,4772 in total
Arithmetic
Previous number2,632,476
Next number2,632,478
Double5,264,954
Half1,316,238.5
Square6,929,935,155,529
Cube18,242,894,908,421,515,333
Square root1,622.490986107≈irrational, shown to 9 decimal places
Cube root138.077059112≈
Negation-2,632,477
Reciprocal3.79870365 × 10^-7≈
Representations
Decimal2,632,477
Binary101000001010110001110122 bits
Octal12025435
Hexadecimal282B1D
Base 361KF8D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and thirty-two thousand, four hundred and seventy-seven
Ordinaltwo million, six hundred and thirty-two thousand, four hundred and seventy-seventh
Scientific notation2.632477 × 10^6
Engineering notation2.632477 × 10^6
In other bases
Ternary11221202002011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1133214402base 5; one hand: 10 digits
Septenary31242601base 7: 8 digits
Nonary4852064base 9; each digit is two ternary digits: 7 digits
Duodecimala6b511base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalg913hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:11:14:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT00TT1T01T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110000111111101101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010000010101100011101
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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
Bytes328 2b 1d
Gray code1111000011111010010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010000010101100011101
64-bit0000000000000000000000000000000000000000001010000010101100011101
One's complement11111111110101111101010011100010at 32 bits, every bit flipped
Bits reversed10111000110101000001010000000000at 32 bits
Rotated left by 100000000010100000101011000111010at 32 bits, wrapping
Shifted left by 110100000101011000111010= 5,264,954, no wrap
Shifted right by 1101000001010110001110= 1,316,238, discarding the low bit
These bits as a double1.30061645 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,632,477 to the power 26,929,935,155,529
2,632,477 to the power 318,242,894,908,421,515,333
2,632,477 to the power 448,024,001,259,836,745,419,269,841
2,632,477 to the power 5126,422,078,764,491,256,071,083,213,226,157
First ten multiples2,632,477, 5,264,954, 7,897,431, 10,529,908, 13,162,385, 15,794,862, 18,427,339, 21,059,816, 23,692,293, 26,324,770
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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 1174the total stopping time
Highest value reached7,897,4323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,632,477 → 7,897,432 → 3,948,716 → 1,974,358 → 987,179 → 2,961,538 → 1,480,769 → 4,442,308 → 2,221,154 → 1,110,577 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage263,247,700%
2,632,477% as a decimal26,324.77
2,632,477% of 1002,632,477
2,632,477% of 1,00026,324,770
As a fraction of 1002,632,477/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,632,477
Nerdulate something else
Nothing in mind? Surprise me · today’s page