Recognised as Number
1,315,958
- Positive
- Even
- Composite
- 7 digits
1,315,958 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,315,958
Digit count7
Digit sum32
Digit product5,400
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 7 × 93,997
Distinct prime factors32, 7, 93,997
Number of divisors8
Sum of divisors σ(n)2,255,952
Aliquot sum939,994sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)563,976integers below n that share no factor with it
Carmichael function λ(n)93,996the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 563,976
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 14, 93,997, 187,994, 657,979, 1,315,9588 in total
Arithmetic
Previous number1,315,957
Next number1,315,959
Double2,631,916
Half657,979
Square1,731,745,457,764
Cube2,278,904,289,108,197,912
Square root1,147.152125919≈irrational, shown to 9 decimal places
Cube root109.584048951≈
Negation-1,315,958
Reciprocal7.59902672 × 10^-7≈
Representations
Decimal1,315,958
Binary10100000101000111011021 bits
Octal5012166
Hexadecimal141476
Base 36S7EE
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and fifteen thousand, nine hundred and fifty-eight
Ordinalone million, three hundred and fifteen thousand, nine hundred and fifty-eighth
Scientific notation1.315958 × 10^6
Engineering notation1.315958 × 10^6
In other bases
Ternary2110212011012base 3; the most digit-efficient integer base after e: 13 digits
Quinary314102313base 5; one hand: 9 digits
Septenary14120420base 7: 8 digits
Nonary2425135base 9; each digit is two ternary digits: 7 digits
Duodecimal535672base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal849hibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:5:32:38base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1110TT0111TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000001010110001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000001010001110110
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes314 14 76
Gray code111100001111001001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000001010001110110
64-bit0000000000000000000000000000000000000000000101000001010001110110
One's complement11111111111010111110101110001001at 32 bits, every bit flipped
Bits reversed01101110001010000010100000000000at 32 bits
Rotated left by 100000000001010000010100011101100at 32 bits, wrapping
Shifted left by 11010000010100011101100= 2,631,916, no wrap
Shifted right by 110100000101000111011= 657,979, discarding the low bit
These bits as a double6.50169639 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,315,958 to the power 21,731,745,457,764
1,315,958 to the power 32,278,904,289,108,197,912
1,315,958 to the power 42,998,942,330,486,245,907,879,696
1,315,958 to the power 53,946,482,151,342,019,192,441,548,988,768
First ten multiples1,315,958, 2,631,916, 3,947,874, 5,263,832, 6,579,790, 7,895,748, 9,211,706, 10,527,664, 11,843,622, 13,159,580
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 5
Divisible by 10No, remainder 8
Divisible by 11No, remainder 6
Divisible by 12No, remainder 2
Divisible by 100No, remainder 58
Collatz (3n + 1) trajectory
Steps to reach 1173the total stopping time
Highest value reached3,331,0242× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,315,958 → 657,979 → 1,973,938 → 986,969 → 2,960,908 → 1,480,454 → 740,227 → 2,220,682 → 1,110,341 → 3,331,024 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage131,595,800%
1,315,958% as a decimal13,159.58
1,315,958% of 1001,315,958
1,315,958% of 1,00013,159,580
As a fraction of 1001,315,958/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 1,315,958
Nerdulate something else
Nothing in mind? Surprise me · today’s page