Nerdulator> put something in

Recognised as Number

5,636,731

  • Positive
  • Odd
  • Prime
  • 7 digits

5,636,731 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,636,731
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,636,731
Distinct prime factors15,636,731
Number of divisors2
Sum of divisors σ(n)5,636,732
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,636,730integers below n that share no factor with it
Carmichael function λ(n)5,636,730the 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,636,7312 in total

Arithmetic

Previous number5,636,730
Next number5,636,732
Cube179,094,368,031,094,405,891
Square root2,374.180068992≈irrational, shown to 9 decimal places
Cube root177.96821172≈
Negation-5,636,731
Reciprocal1.77407792 × 10^-7≈

Representations

Decimal5,636,731
Binary1010110000000100111101123 bits
Octal25401173
Hexadecimal56027B
Base 363CTBV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, six hundred and thirty-six thousand, seven hundred and thirty-one
Ordinalfive million, six hundred and thirty-six thousand, seven hundred and thirty-first
Scientific notation5.636731 × 10^6
Engineering notation5.636731 × 10^6

In other bases

Ternary101121101010211base 3; the most digit-efficient integer base after e: 15 digits
Quinary2420333411base 5; one hand: 10 digits
Septenary65624422base 7: 8 digits
Nonary11541124base 9; each digit is two ternary digits: 8 digits
Duodecimal1a79bb7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1f4bgbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal26:5:45:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11TTT1101011T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010100000011110001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010101100000001001111011
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 set bits, so odd; 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
Bytes356 02 7b
Gray code11111010000001101000110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010101100000001001111011
64-bit0000000000000000000000000000000000000000010101100000001001111011
One's complement11111111101010011111110110000100at 32 bits, every bit flipped
Bits reversed11011110010000000110101000000000at 32 bits
Rotated left by 100000000101011000000010011110110at 32 bits, wrapping
Shifted left by 1101011000000010011110110= 11,273,462, no wrap
Shifted right by 11010110000000100111101= 2,818,365, discarding the low bit
These bits as a double2.78491514 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,636,747+16
Previous prime5,636,693−38
Distance to nearest prime0, it is prime
Nearest square below5,635,876
Nearest square above5,640,625

Powers & multiples

5,636,731 to the power 231,772,736,366,361
5,636,731 to the power 3179,094,368,031,094,405,891
5,636,731 to the power 41,009,506,776,206,278,801,612,382,321
5,636,731 to the power 55,690,318,140,151,994,115,691,365,412,632,651
First ten multiples5,636,731, 11,273,462, 16,910,193, 22,546,924, 28,183,655, 33,820,386, 39,457,117, 45,093,848, 50,730,579, 56,367,310
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 1183the total stopping time
Highest value reached28,535,9565× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,636,731 → 16,910,194 → 8,455,097 → 25,365,292 → 12,682,646 → 6,341,323 → 19,023,970 → 9,511,985 → 28,535,956 → 14,267,978 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage563,673,100%
5,636,731% as a decimal56,367.31
5,636,731% of 1005,636,731
5,636,731% of 1,00056,367,310
As a fraction of 1005,636,731/100

Read another way

As bytes5.376 MiB
As a 24-bit colour#56027B

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