Nerdulator> put something in

Recognised as Number

1,802,837

  • Positive
  • Odd
  • Prime
  • 7 digits

1,802,837 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 value1,802,837
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation1,802,837
Distinct prime factors11,802,837
Number of divisors2
Sum of divisors σ(n)1,802,838
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,802,836integers below n that share no factor with it
Carmichael function λ(n)1,802,836the 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, 1,802,8372 in total

Arithmetic

Previous number1,802,836
Next number1,802,838
Double3,605,674
Cube5,859,619,125,106,390,253
Square root1,342.697657703≈irrational, shown to 9 decimal places
Cube root121.70791454≈
Negation-1,802,837
Reciprocal5.54681316 × 10^-7≈

Representations

Decimal1,802,837
Binary11011100000100101010121 bits
Octal6701125
Hexadecimal1B8255
Base 3612N2T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, eight hundred and two thousand, eight hundred and thirty-seven
Ordinalone million, eight hundred and two thousand, eight hundred and thirty-seventh
Scientific notation1.802837 × 10^6
Engineering notation1.802837 × 10^6

In other bases

Ternary10101121000202base 3; the most digit-efficient integer base after e: 14 digits
Quinary430142322base 5; one hand: 9 digits
Septenary21216041base 7: 8 digits
Nonary3347022base 9; each digit is two ternary digits: 7 digits
Duodecimal72b385base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalb571hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal8:20:47:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1011TTT1001T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011001000011001010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000110111000001001010101
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes31b 82 55
Gray code101100100001101111111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000110111000001001010101
64-bit0000000000000000000000000000000000000000000110111000001001010101
One's complement11111111111001000111110110101010at 32 bits, every bit flipped
Bits reversed10101010010000011101100000000000at 32 bits
Rotated left by 100000000001101110000010010101010at 32 bits, wrapping
Shifted left by 11101110000010010101010= 3,605,674, no wrap
Shifted right by 111011100000100101010= 901,418, discarding the low bit
These bits as a double8.90719827 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,802,839+2
Previous prime1,802,821−16
Distance to nearest prime0, it is prime
Nearest square below1,800,964
Nearest square above1,803,649

Powers & multiples

1,802,837 to the power 23,250,221,248,569
1,802,837 to the power 35,859,619,125,106,390,253
1,802,837 to the power 410,563,938,164,649,429,284,547,761
1,802,837 to the power 519,045,058,588,942,083,143,066,231,797,957
First ten multiples1,802,837, 3,605,674, 5,408,511, 7,211,348, 9,014,185, 10,817,022, 12,619,859, 14,422,696, 16,225,533, 18,028,370
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 165the total stopping time
Highest value reached5,408,5123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,802,837 → 5,408,512 → 2,704,256 → 1,352,128 → 676,064 → 338,032 → 169,016 → 84,508 → 42,254 → 21,127 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage180,283,700%
1,802,837% as a decimal18,028.37
1,802,837% of 1001,802,837
1,802,837% of 1,00018,028,370
As a fraction of 1001,802,837/100

Read another way

As bytes1.719 MiB
As a 24-bit colour#1B8255

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