Nerdulator> put something in

Recognised as Number

5,617,363

  • Positive
  • Odd
  • Prime
  • 7 digits

5,617,363 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 value5,617,363
Digit count7
Digit sum31
Digit product11,340
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 factorisation5,617,363
Distinct prime factors15,617,363
Number of divisors2
Sum of divisors σ(n)5,617,364
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,617,362integers below n that share no factor with it
Carmichael function λ(n)5,617,362the 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, 5,617,3632 in total

Arithmetic

Previous number5,617,362
Next number5,617,364
Cube177,254,581,033,808,251,147
Square root2,370.097677312≈irrational, shown to 9 decimal places
Cube root177.764142863≈
Negation-5,617,363
Reciprocal1.78019473 × 10^-7≈

Representations

Decimal5,617,363
Binary1010101101101101101001123 bits
Octal25333323
Hexadecimal55B6D3
Base 363CEDV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, six hundred and seventeen thousand, three hundred and sixty-three
Ordinalfive million, six hundred and seventeen thousand, three hundred and sixty-third
Scientific notation5.617363 × 10^6
Engineering notation5.617363 × 10^6

In other bases

Ternary101120101120111base 3; the most digit-efficient integer base after e: 15 digits
Quinary2414223423base 5; one hand: 10 digits
Septenary65514103base 7: 8 digits
Nonary11511514base 9; each digit is two ternary digits: 8 digits
Duodecimal1a6a957base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1f2383base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal26:0:22:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11TTT011TTT0111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010101100101111010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010101011011011011010011
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes355 b6 d3
Gray code11111110110110110111010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010101011011011011010011
64-bit0000000000000000000000000000000000000000010101011011011011010011
One's complement11111111101010100100100100101100at 32 bits, every bit flipped
Bits reversed11001011011011011010101000000000at 32 bits
Rotated left by 100000000101010110110110110100110at 32 bits, wrapping
Shifted left by 1101010110110110110100110= 11,234,726, no wrap
Shifted right by 11010101101101101101001= 2,808,681, discarding the low bit
These bits as a double2.77534608 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,617,373+10
Previous prime5,617,349−14
Distance to nearest prime0, it is prime
Nearest square below5,616,900
Nearest square above5,621,641

Powers & multiples

5,617,363 to the power 231,554,767,073,769
5,617,363 to the power 3177,254,581,033,808,251,147
5,617,363 to the power 4995,703,325,079,816,219,087,865,361
5,617,363 to the power 55,593,227,017,280,331,675,904,068,627,863,043
First ten multiples5,617,363, 11,234,726, 16,852,089, 22,469,452, 28,086,815, 33,704,178, 39,321,541, 44,938,904, 50,556,267, 56,173,630
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 63

Collatz (3n + 1) trajectory

Steps to reach 1170the total stopping time
Highest value reached25,278,1364× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,617,363 → 16,852,090 → 8,426,045 → 25,278,136 → 12,639,068 → 6,319,534 → 3,159,767 → 9,479,302 → 4,739,651 → 14,218,954 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage561,736,300%
5,617,363% as a decimal56,173.63
5,617,363% of 1005,617,363
5,617,363% of 1,00056,173,630
As a fraction of 1005,617,363/100

Read another way

As bytes5.357 MiB
As a 24-bit colour#55B6D3

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