Nerdulator> put something in

Recognised as Number

9,526,513

  • Positive
  • Odd
  • Prime
  • 7 digits

9,526,513 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,526,513
Digit count7
Digit sum31
Digit product8,100
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation9,526,513
Distinct prime factors19,526,513
Number of divisors2
Sum of divisors σ(n)9,526,514
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,526,512integers below n that share no factor with it
Carmichael function λ(n)9,526,512the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 9,526,5132 in total

Arithmetic

Previous number9,526,512
Next number9,526,514
Cube864,573,447,153,342,687,697
Square root3,086.504981366≈irrational, shown to 9 decimal places
Cube root211.988021454≈
Negation-9,526,513
Reciprocal1.04970203 × 10^-7≈

Representations

Decimal9,526,513
Binary10010001010111001111000124 bits
Octal44256361
Hexadecimal915CF1
Base 365O6PD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, five hundred and twenty-six thousand, five hundred and thirteen
Ordinalnine million, five hundred and twenty-six thousand, five hundred and thirteenth
Scientific notation9.526513 × 10^6
Engineering notation9.526513 × 10^6

In other bases

Ternary122220222220211base 3; the most digit-efficient integer base after e: 15 digits
Quinary4414322023base 5; one hand: 10 digits
Septenary143655043base 7: 9 digits
Nonary18828824base 9; each digit is two ternary digits: 8 digits
Duodecimal3235041base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2jag5dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal44:6:15:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000T10000T1T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100101101010110100110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100100010101110011110001
Bit length24 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits12within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes391 5c f1
Gray code110110011111001010001001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100100010101110011110001
64-bit0000000000000000000000000000000000000000100100010101110011110001
One's complement11111111011011101010001100001110at 32 bits, every bit flipped
Bits reversed10001111001110101000100100000000at 32 bits
Rotated left by 100000001001000101011100111100010at 32 bits, wrapping
Shifted left by 11001000101011100111100010= 19,053,026, no wrap
Shifted right by 110010001010111001111000= 4,763,256, discarding the low bit
These bits as a double4.7067228 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,526,519+6
Previous prime9,526,499−14
Distance to nearest prime0, it is prime
Nearest square below9,523,396
Nearest square above9,529,569

Powers & multiples

9,526,513 to the power 290,754,449,939,169
9,526,513 to the power 3864,573,447,153,342,687,697
9,526,513 to the power 48,236,370,183,761,132,107,800,410,561
9,526,513 to the power 578,463,887,628,412,813,919,678,012,614,703,793
First ten multiples9,526,513, 19,053,026, 28,579,539, 38,106,052, 47,632,565, 57,159,078, 66,685,591, 76,212,104, 85,738,617, 95,265,130
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 175the total stopping time
Highest value reached28,579,5403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,526,513 → 28,579,540 → 14,289,770 → 7,144,885 → 21,434,656 → 10,717,328 → 5,358,664 → 2,679,332 → 1,339,666 → 669,833 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage952,651,300%
9,526,513% as a decimal95,265.13
9,526,513% of 1009,526,513
9,526,513% of 1,00095,265,130
As a fraction of 1009,526,513/100

Read another way

As bytes9.085 MiB
As a 24-bit colour#915CF1

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “9526513” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.