Recognised as Number

9,502,513

Positive
Odd
Prime
7 digits

9,502,513 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value9,502,513

Digit count7

Digit sum25

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation9,502,513

Distinct prime factors19,502,513

Number of divisors2

Sum of divisors σ(n)9,502,514

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)9,502,512integers below n that share no factor with it

Carmichael function λ(n)9,502,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,502,5132 in total

Arithmetic

Previous number9,502,512

Next number9,502,514

Double19,005,026

Half4,751,256.5

Square90,297,753,315,169

Cube858,055,574,748,186,519,697

Square root3,082.61463696≈irrational, shown to 9 decimal places

Cube root211.809852346≈

Negation-9,502,513

Reciprocal1.0523532 × 10^-7≈

Representations

Decimal9,502,513

Binary10010000111111110011000124 bits

Octal44177461

Hexadecimal90FF31

Base 365NO6P

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsnine million, five hundred and two thousand, five hundred and thirteen

Ordinalnine million, five hundred and two thousand, five hundred and thirteenth

Scientific notation9.502513 × 10^6

Engineering notation9.502513 × 10^6

In other bases

Ternary122212202222221base 3; the most digit-efficient integer base after e: 15 digits

Quinary4413040023base 5; one hand: 10 digits

Septenary143525056base 7: 9 digits

Nonary18782887base 9; each digit is two ternary digits: 8 digits

Duodecimal3223181base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal2j7g5dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal43:59:35:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T000T0T100000T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1100100010000001101110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100100001111111100110001

Bit length24 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits11within that length

Bit parityodd13 set bits, so odd; 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

Bytes390 ff 31

Gray code110110001000000010101001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100100001111111100110001

64-bit0000000000000000000000000000000000000000100100001111111100110001

One's complement11111111011011110000000011001110at 32 bits, every bit flipped

Bits reversed10001100111111110000100100000000at 32 bits

Rotated left by 100000001001000011111111001100010at 32 bits, wrapping

Shifted left by 11001000011111111001100010= 19,005,026, no wrap

Shifted right by 110010000111111110011000= 4,751,256, discarding the low bit

These bits as a double4.69486522 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,502,531+18

Previous prime9,502,499−14

Distance to nearest prime0, it is prime

Nearest square below9,498,724

Nearest square above9,504,889

Powers & multiples

9,502,513 to the power 290,297,753,315,169

9,502,513 to the power 3858,055,574,748,186,519,697

9,502,513 to the power 48,153,684,253,767,114,129,845,498,561

9,502,513 to the power 577,480,490,619,317,300,991,340,538,067,383,793

First ten multiples9,502,513, 19,005,026, 28,507,539, 38,010,052, 47,512,565, 57,015,078, 66,517,591, 76,020,104, 85,522,617, 95,025,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 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 3

Divisible by 11No, remainder 9

Divisible by 12No, remainder 1

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1101the total stopping time

Highest value reached28,507,5403× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps9,502,513 → 28,507,540 → 14,253,770 → 7,126,885 → 21,380,656 → 10,690,328 → 5,345,164 → 2,672,582 → 1,336,291 → 4,008,874 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage950,251,300%

9,502,513% as a decimal95,025.13

9,502,513% of 1009,502,513

9,502,513% of 1,00095,025,130

As a fraction of 1009,502,513/100

Read another way

As seconds109 days, 23 hours and 35 minutes

As bytes9.062 MiB

As a 24-bit colour#90FF31

Keep nerding

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