Number
9,509,701
- Positive
- Odd
- Prime
- 7 digits
9,509,701 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,509,701
Digit count7
Digit sum31
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation9,509,701
Distinct prime factors19,509,701
Number of divisors2
Sum of divisors σ(n)9,509,702
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,509,700integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 9,509,7012 in total
Arithmetic
Previous number9,509,700
Next number9,509,702
Double19,019,402
Half4,754,850.5
Square90,434,413,109,401
Cube860,004,228,780,883,799,101
Square root3,083.780309944≈irrational, shown to 9 decimal places
Cube root211.863245433≈
Negation-9,509,701
Reciprocal1.05155777 × 10^-7≈
Representations
Decimal9,509,701
Binary10010001000110110100010124 bits
Octal44215505
Hexadecimal911B45
Base 365NTQD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, five hundred and nine thousand, seven hundred and one
Ordinalnine million, five hundred and nine thousand, seven hundred and first
Scientific notation9.509701 × 10^6
Engineering notation9.509701 × 10^6
Nearest landmarks
Powers & multiples
9,509,701 to the power 290,434,413,109,401
9,509,701 to the power 3860,004,228,780,883,799,101
9,509,701 to the power 48,178,383,074,441,799,445,194,578,801
9,509,701 to the power 577,773,977,701,402,254,625,766,331,218,448,501
First ten multiples9,509,701, 19,019,402, 28,529,103, 38,038,804, 47,548,505, 57,058,206, 66,567,907, 76,077,608, 85,587,309, 95,097,010
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1176the total stopping time
Highest value reached28,529,1043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,509,701 → 28,529,104 → 14,264,552 → 7,132,276 → 3,566,138 → 1,783,069 → 5,349,208 → 2,674,604 → 1,337,302 → 668,651 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage950,970,100%
9,509,701% as a decimal95,097.01
9,509,701% of 1009,509,701
9,509,701% of 1,00095,097,010
As a fraction of 1009,509,701/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 9,509,701
Nerdulate something else
Nothing in mind? Surprise me · today’s page