Recognised as Number
2,915,137
- Positive
- Odd
- Prime
- 7 digits
2,915,137 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,915,137
Digit count7
Digit sum28
Digit product1,890
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,915,137
Distinct prime factors12,915,137
Number of divisors2
Sum of divisors σ(n)2,915,138
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,915,136integers below n that share no factor with it
Carmichael function λ(n)2,915,136the 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,915,1372 in total
Arithmetic
Previous number2,915,136
Next number2,915,138
Double5,830,274
Half1,457,568.5
Square8,498,023,728,769
Cube24,772,903,398,612,476,353
Square root1,707.377228383≈irrational, shown to 9 decimal places
Cube root142.851999386≈
Negation-2,915,137
Reciprocal3.43037051 × 10^-7≈
Representations
Decimal2,915,137
Binary101100011110110100000122 bits
Octal13075501
Hexadecimal2C7B41
Base 361QHC1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, nine hundred and fifteen thousand, one hundred and thirty-seven
Ordinaltwo million, nine hundred and fifteen thousand, one hundred and thirty-seventh
Scientific notation2.915137 × 10^6
Engineering notation2.915137 × 10^6
In other bases
Ternary12111002211001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1221241022base 5; one hand: 10 digits
Septenary33530641base 7: 8 digits
Nonary5432731base 9; each digit is two ternary digits: 7 digits
Duodecimalb87001base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimali47ghbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:29:45:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT111010T11001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111011000111101000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011000111101101000001
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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
Bytes32c 7b 41
Gray code1110100100011011100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011000111101101000001
64-bit0000000000000000000000000000000000000000001011000111101101000001
One's complement11111111110100111000010010111110at 32 bits, every bit flipped
Bits reversed10000010110111100011010000000000at 32 bits
Rotated left by 100000000010110001111011010000010at 32 bits, wrapping
Shifted left by 110110001111011010000010= 5,830,274, no wrap
Shifted right by 1101100011110110100000= 1,457,568, discarding the low bit
These bits as a double1.44026904 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,915,137 to the power 28,498,023,728,769
2,915,137 to the power 324,772,903,398,612,476,353
2,915,137 to the power 472,216,407,294,720,978,478,255,361
2,915,137 to the power 5210,520,720,911,911,029,038,165,898,299,457
First ten multiples2,915,137, 5,830,274, 8,745,411, 11,660,548, 14,575,685, 17,490,822, 20,405,959, 23,321,096, 26,236,233, 29,151,370
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 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 176the total stopping time
Highest value reached8,745,4123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,915,137 → 8,745,412 → 4,372,706 → 2,186,353 → 6,559,060 → 3,279,530 → 1,639,765 → 4,919,296 → 2,459,648 → 1,229,824 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage291,513,700%
2,915,137% as a decimal29,151.37
2,915,137% of 1002,915,137
2,915,137% of 1,00029,151,370
As a fraction of 1002,915,137/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,915,137
Nerdulate something else
Nothing in mind? Surprise me · today’s page