Number
1,315,071
- Positive
- Odd
- Composite
- 7 digits
1,315,071 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,315,071
Digit count7
Digit sum18
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 23 × 6,353
Distinct prime factors33, 23, 6,353
Number of divisors12
Sum of divisors σ(n)1,982,448
Aliquot sum667,377sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)838,464integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 23, 69, 207, 6,353, 19,059, 57,177, 146,119, 438,357, 1,315,07112 in total
Arithmetic
Previous number1,315,070
Next number1,315,072
Double2,630,142
Half657,535.5
Square1,729,411,735,041
Cube2,274,299,219,812,102,911
Square root1,146.765451171≈irrational, shown to 9 decimal places
Cube root109.559422304≈
Negation-1,315,071
Reciprocal7.60415217 × 10^-7≈
Representations
Decimal1,315,071
Binary10100000100001111111121 bits
Octal5010377
Hexadecimal1410FF
Base 36S6PR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and fifteen thousand and seventy-one
Ordinalone million, three hundred and fifteen thousand and seventy-first
Scientific notation1.315071 × 10^6
Engineering notation1.315071 × 10^6
Nearest landmarks
Powers & multiples
1,315,071 to the power 21,729,411,735,041
1,315,071 to the power 32,274,299,219,812,102,911
1,315,071 to the power 42,990,864,949,297,521,987,271,681
1,315,071 to the power 53,933,199,759,737,641,537,323,356,804,351
First ten multiples1,315,071, 2,630,142, 3,945,213, 5,260,284, 6,575,355, 7,890,426, 9,205,497, 10,520,568, 11,835,639, 13,150,710
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1217the total stopping time
Highest value reached67,407,71251× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,315,071 → 3,945,214 → 1,972,607 → 5,917,822 → 2,958,911 → 8,876,734 → 4,438,367 → 13,315,102 → 6,657,551 → 19,972,654 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage131,507,100%
1,315,071% as a decimal13,150.71
1,315,071% of 1001,315,071
1,315,071% of 1,00013,150,710
As a fraction of 1001,315,071/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,071
Nerdulate something else
Nothing in mind? Surprise me · today’s page