Recognised as Number

9,504,113

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value9,504,113

Digit count7

Digit sum23

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation9,504,113

Distinct prime factors19,504,113

Number of divisors2

Sum of divisors σ(n)9,504,114

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)9,504,112the 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,504,1132 in total

Arithmetic

Previous number9,504,112

Next number9,504,114

Double19,008,226

Half4,752,056.5

Square90,328,163,916,769

Cube858,489,076,947,495,170,897

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

Cube root211.821739614≈

Negation-9,504,113

Reciprocal1.05217604 × 10^-7≈

Representations

Decimal9,504,113

Binary10010001000001010111000124 bits

Octal44202561

Hexadecimal910571

Base 365NPF5

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

In wordsnine million, five hundred and four thousand, one hundred and thirteen

Ordinalnine million, five hundred and four thousand, one hundred and thirteenth

Scientific notation9.504113 × 10^6

Engineering notation9.504113 × 10^6

In other bases

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

Quinary4413112423base 5; one hand: 10 digits

Septenary143532533base 7: 9 digits

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

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

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

Sexagesimal44:0:1:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000100100010000010101110001

Bit length24 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits15within that length

Bit parityodd9 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

Bytes391 05 71

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

At each machine width

32-bit00000000100100010000010101110001

64-bit0000000000000000000000000000000000000000100100010000010101110001

One's complement11111111011011101111101010001110at 32 bits, every bit flipped

Bits reversed10001110101000001000100100000000at 32 bits

Rotated left by 100000001001000100000101011100010at 32 bits, wrapping

Shifted left by 11001000100000101011100010= 19,008,226, no wrap

Shifted right by 110010001000001010111000= 4,752,056, discarding the low bit

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

Nearest landmarks

Next prime9,504,163+50

Previous prime9,504,097−16

Distance to nearest prime0, it is prime

Nearest square below9,498,724

Nearest square above9,504,889

Powers & multiples

9,504,113 to the power 290,328,163,916,769

9,504,113 to the power 3858,489,076,947,495,170,897

9,504,113 to the power 48,159,177,196,574,689,171,159,399,361

9,504,113 to the power 577,545,742,063,269,058,822,575,272,539,071,793

First ten multiples9,504,113, 19,008,226, 28,512,339, 38,016,452, 47,520,565, 57,024,678, 66,528,791, 76,032,904, 85,537,017, 95,041,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 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 3

Divisible by 11No, remainder 3

Divisible by 12No, remainder 5

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1194the total stopping time

Highest value reached28,512,3403× the starting value

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

First steps9,504,113 → 28,512,340 → 14,256,170 → 7,128,085 → 21,384,256 → 10,692,128 → 5,346,064 → 2,673,032 → 1,336,516 → 668,258 → …

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

As a percentage & fraction

As a percentage950,411,300%

9,504,113% as a decimal95,041.13

9,504,113% of 1009,504,113

9,504,113% of 1,00095,041,130

As a fraction of 1009,504,113/100

Read another way

As seconds110 days, 1 minute and 53 seconds

As bytes9.064 MiB

As a 24-bit colour#910571

Keep nerding

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