Recognised as Number
1,315,847
- Positive
- Odd
- Composite
- 7 digits
1,315,847 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,315,847
Digit count7
Digit sum29
Digit product3,360
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation13 × 127 × 797
Distinct prime factors313, 127, 797
Number of divisors8
Sum of divisors σ(n)1,430,016
Aliquot sum114,169sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,203,552integers below n that share no factor with it
Carmichael function λ(n)50,148the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,203,552
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 127, 797, 1,651, 10,361, 101,219, 1,315,8478 in total
Arithmetic
Previous number1,315,846
Next number1,315,848
Double2,631,694
Half657,923.5
Square1,731,453,327,409
Cube2,278,327,666,511,150,423
Square root1,147.103744218≈irrational, shown to 9 decimal places
Cube root109.580967756≈
Negation-1,315,847
Reciprocal7.59966774 × 10^-7≈
Representations
Decimal1,315,847
Binary10100000101000000011121 bits
Octal5012007
Hexadecimal141407
Base 36S7BB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and fifteen thousand, eight hundred and forty-seven
Ordinalone million, three hundred and fifteen thousand, eight hundred and forty-seventh
Scientific notation1.315847 × 10^6
Engineering notation1.315847 × 10^6
In other bases
Ternary2110212000002base 3; the most digit-efficient integer base after e: 13 digits
Quinary314101342base 5; one hand: 9 digits
Septenary14120201base 7: 8 digits
Nonary2425002base 9; each digit is two ternary digits: 7 digits
Duodecimal53559bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal849c7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:5:30:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1110TT00001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000001010000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000001010000000111
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes314 14 07
Gray code111100001111000000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000001010000000111
64-bit0000000000000000000000000000000000000000000101000001010000000111
One's complement11111111111010111110101111111000at 32 bits, every bit flipped
Bits reversed11100000001010000010100000000000at 32 bits
Rotated left by 100000000001010000010100000001110at 32 bits, wrapping
Shifted left by 11010000010100000001110= 2,631,694, no wrap
Shifted right by 110100000101000000011= 657,923, discarding the low bit
These bits as a double6.50114798 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,315,847 to the power 21,731,453,327,409
1,315,847 to the power 32,278,327,666,511,150,423
1,315,847 to the power 42,997,930,624,995,697,750,653,281
1,315,847 to the power 53,944,818,019,108,713,898,103,867,844,007
First ten multiples1,315,847, 2,631,694, 3,947,541, 5,263,388, 6,579,235, 7,895,082, 9,210,929, 10,526,776, 11,842,623, 13,158,470
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1142the total stopping time
Highest value reached8,881,9726× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,315,847 → 3,947,542 → 1,973,771 → 5,921,314 → 2,960,657 → 8,881,972 → 4,440,986 → 2,220,493 → 6,661,480 → 3,330,740 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage131,584,700%
1,315,847% as a decimal13,158.47
1,315,847% of 1001,315,847
1,315,847% of 1,00013,158,470
As a fraction of 1001,315,847/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,847
Nerdulate something else
Nothing in mind? Surprise me · today’s page