Recognised as Number
1,315,857
- Positive
- Odd
- Composite
- 7 digits
1,315,857 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,315,857
Digit count7
Digit sum30
Digit product4,200
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 31 × 14,149
Distinct prime factors33, 31, 14,149
Number of divisors8
Sum of divisors σ(n)1,811,200
Aliquot sum495,343sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)848,880integers below n that share no factor with it
Carmichael function λ(n)70,740the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 848,880
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 31, 93, 14,149, 42,447, 438,619, 1,315,8578 in total
Arithmetic
Previous number1,315,856
Next number1,315,858
Double2,631,714
Half657,928.5
Square1,731,479,644,449
Cube2,278,379,610,505,727,793
Square root1,147.108103014≈irrational, shown to 9 decimal places
Cube root109.581245348≈
Negation-1,315,857
Reciprocal7.59960999 × 10^-7≈
Representations
Decimal1,315,857
Binary10100000101000001000121 bits
Octal5012021
Hexadecimal141411
Base 36S7BL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and fifteen thousand, eight hundred and fifty-seven
Ordinalone million, three hundred and fifteen thousand, eight hundred and fifty-seventh
Scientific notation1.315857 × 10^6
Engineering notation1.315857 × 10^6
In other bases
Ternary2110212000110base 3; the most digit-efficient integer base after e: 13 digits
Quinary314101412base 5; one hand: 9 digits
Septenary14120214base 7: 8 digits
Nonary2425013base 9; each digit is two ternary digits: 7 digits
Duodecimal5355a9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal849chbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:5:30:57base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1110TT000110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000001010000010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000001010000010001
Bit length21 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits15within that length
Bit parityeven6 set bits, so even; 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 11
Gray code111100001111000011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000001010000010001
64-bit0000000000000000000000000000000000000000000101000001010000010001
One's complement11111111111010111110101111101110at 32 bits, every bit flipped
Bits reversed10001000001010000010100000000000at 32 bits
Rotated left by 100000000001010000010100000100010at 32 bits, wrapping
Shifted left by 11010000010100000100010= 2,631,714, no wrap
Shifted right by 110100000101000001000= 657,928, discarding the low bit
These bits as a double6.50119739 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,315,857 to the power 21,731,479,644,449
1,315,857 to the power 32,278,379,610,505,727,793
1,315,857 to the power 42,998,021,759,141,235,456,513,601
1,315,857 to the power 53,944,967,917,918,308,664,101,617,471,057
First ten multiples1,315,857, 2,631,714, 3,947,571, 5,263,428, 6,579,285, 7,895,142, 9,210,999, 10,526,856, 11,842,713, 13,158,570
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 57
Collatz (3n + 1) trajectory
Steps to reach 1155the total stopping time
Highest value reached3,947,5723× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,315,857 → 3,947,572 → 1,973,786 → 986,893 → 2,960,680 → 1,480,340 → 740,170 → 370,085 → 1,110,256 → 555,128 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage131,585,700%
1,315,857% as a decimal13,158.57
1,315,857% of 1001,315,857
1,315,857% of 1,00013,158,570
As a fraction of 1001,315,857/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,857
Nerdulate something else
Nothing in mind? Surprise me · today’s page