Recognised as Number
7,913,587
- Positive
- Odd
- Composite
- 7 digits
7,913,587 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value7,913,587
Digit count7
Digit sum40
Digit product52,920
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11 × 23 × 31 × 1,009
Distinct prime factors411, 23, 31, 1,009
Number of divisors16
Sum of divisors σ(n)9,308,160
Aliquot sum1,394,573sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,652,800integers below n that share no factor with it
Carmichael function λ(n)55,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,652,800
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 23, 31, 253, 341, 713, 1,009, 7,843, 11,099, 23,207, 31,279, 255,277, 344,069, 719,417, 7,913,58716 in total
Arithmetic
Previous number7,913,586
Next number7,913,588
Double15,827,174
Half3,956,793.5
Square62,624,859,206,569
Cube495,587,271,693,934,753,003
Square root2,813.109844994≈irrational, shown to 9 decimal places
Cube root199.277283215≈
Negation-7,913,587
Reciprocal1.26364947 × 10^-7≈
Representations
Decimal7,913,587
Binary1111000110000000111001123 bits
Octal36140163
Hexadecimal78C073
Base 364PM5V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, nine hundred and thirteen thousand, five hundred and eighty-seven
Ordinalseven million, nine hundred and thirteen thousand, five hundred and eighty-seventh
Scientific notation7.913587 × 10^6
Engineering notation7.913587 × 10^6
In other bases
Ternary112220001101211base 3; the most digit-efficient integer base after e: 15 digits
Quinary4011213322base 5; one hand: 10 digits
Septenary124156453base 7: 9 digits
Nonary15801354base 9; each digit is two ternary digits: 8 digits
Duodecimal2797757base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2993j7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal36:38:13:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT00T000111TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100010011100000110110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011110001100000001110011
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes378 c0 73
Gray code10001001010000001001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011110001100000001110011
64-bit0000000000000000000000000000000000000000011110001100000001110011
One's complement11111111100001110011111110001100at 32 bits, every bit flipped
Bits reversed11001110000000110001111000000000at 32 bits
Rotated left by 100000000111100011000000011100110at 32 bits, wrapping
Shifted left by 1111100011000000011100110= 15,827,174, no wrap
Shifted right by 11111000110000000111001= 3,956,793, discarding the low bit
These bits as a double3.90983147 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,913,587 to the power 262,624,859,206,569
7,913,587 to the power 3495,587,271,693,934,753,003
7,913,587 to the power 43,921,872,990,642,590,040,212,751,761
7,913,587 to the power 531,036,083,114,400,322,188,557,109,570,076,707
First ten multiples7,913,587, 15,827,174, 23,740,761, 31,654,348, 39,567,935, 47,481,522, 55,395,109, 63,308,696, 71,222,283, 79,135,870
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached35,611,1444× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,913,587 → 23,740,762 → 11,870,381 → 35,611,144 → 17,805,572 → 8,902,786 → 4,451,393 → 13,354,180 → 6,677,090 → 3,338,545 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage791,358,700%
7,913,587% as a decimal79,135.87
7,913,587% of 1007,913,587
7,913,587% of 1,00079,135,870
As a fraction of 1007,913,587/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 7,913,587
Nerdulate something else
Nothing in mind? Surprise me · today’s page