Nerdulator> put something in

Recognised as Number

9,823,367

  • Positive
  • Odd
  • Prime
  • 7 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value9,823,367
Digit count7
Digit sum38
Digit product54,432
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation9,823,367
Distinct prime factors19,823,367
Number of divisors2
Sum of divisors σ(n)9,823,368
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,823,366integers below n that share no factor with it
Carmichael function λ(n)9,823,366the 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,823,3672 in total

Arithmetic

Previous number9,823,366
Next number9,823,368
Cube947,940,565,689,428,571,863
Square root3,134.225103594≈irrational, shown to 9 decimal places
Cube root214.167445446≈
Negation-9,823,367
Reciprocal1.0179809 × 10^-7≈

Representations

Decimal9,823,367
Binary10010101111001001000011124 bits
Octal45362207
Hexadecimal95E487
Base 365UJRB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, eight hundred and twenty-three thousand, three hundred and sixty-seven
Ordinalnine million, eight hundred and twenty-three thousand, three hundred and sixty-seventh
Scientific notation9.823367 × 10^6
Engineering notation9.823367 × 10^6

In other bases

Ternary200111002010102base 3; the most digit-efficient integer base after e: 15 digits
Quinary10003321432base 5; one hand: 11 digits
Septenary146332361base 7: 9 digits
Nonary20432112base 9; each digit is two ternary digits: 8 digits
Duodecimal335899bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal317i87base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal45:28:42:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0011101T01011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010100010010110011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100101011110010010000111
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
Bytes395 e4 87
Gray code110111110001011011000100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100101011110010010000111
64-bit0000000000000000000000000000000000000000100101011110010010000111
One's complement11111111011010100001101101111000at 32 bits, every bit flipped
Bits reversed11100001001001111010100100000000at 32 bits
Rotated left by 100000001001010111100100100001110at 32 bits, wrapping
Shifted left by 11001010111100100100001110= 19,646,734, no wrap
Shifted right by 110010101111001001000011= 4,911,683, discarding the low bit
These bits as a double4.85338816 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,823,403+36
Previous prime9,823,351−16
Distance to nearest prime0, it is prime
Nearest square below9,821,956
Nearest square above9,828,225

Powers & multiples

9,823,367 to the power 296,498,539,216,689
9,823,367 to the power 3947,940,565,689,428,571,863
9,823,367 to the power 49,311,968,070,954,864,881,696,122,721
9,823,367 to the power 591,474,879,853,271,678,168,312,595,965,421,607
First ten multiples9,823,367, 19,646,734, 29,470,101, 39,293,468, 49,116,835, 58,940,202, 68,763,569, 78,586,936, 88,410,303, 98,233,670
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 1145the total stopping time
Highest value reached66,307,7326× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,823,367 → 29,470,102 → 14,735,051 → 44,205,154 → 22,102,577 → 66,307,732 → 33,153,866 → 16,576,933 → 49,730,800 → 24,865,400 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage982,336,700%
9,823,367% as a decimal98,233.67
9,823,367% of 1009,823,367
9,823,367% of 1,00098,233,670
As a fraction of 1009,823,367/100

Read another way

As bytes9.368 MiB
As a 24-bit colour#95E487

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 “9823367” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.