Nerdulator> put something in

Recognised as Number

1,638,537

  • Positive
  • Odd
  • Composite
  • 7 digits

1,638,537 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,638,537
Digit count7
Digit sum33
Digit product15,120
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 546,179
Distinct prime factors23, 546,179
Number of divisors4
Sum of divisors σ(n)2,184,720
Aliquot sum546,183sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,092,356integers below n that share no factor with it
Carmichael function λ(n)546,178the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,092,356
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 546,179, 1,638,5374 in total

Arithmetic

Previous number1,638,536
Next number1,638,538
Double3,277,074
Cube4,399,149,873,084,120,153
Square root1,280.053514506≈irrational, shown to 9 decimal places
Cube root117.892293752≈
Negation-1,638,537
Reciprocal6.1030053 × 10^-7≈

Representations

Decimal1,638,537
Binary11001000000001000100121 bits
Octal6200211
Hexadecimal190089
Base 36Z4AX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and thirty-eight thousand, five hundred and thirty-seven
Ordinalone million, six hundred and thirty-eight thousand, five hundred and thirty-seventh
Scientific notation1.638537 × 10^6
Engineering notation1.638537 × 10^6

In other bases

Ternary10002020122120base 3; the most digit-efficient integer base after e: 14 digits
Quinary404413122base 5; one hand: 9 digits
Septenary16633035base 7: 8 digits
Nonary3066576base 9; each digit is two ternary digits: 7 digits
Duodecimal670289base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala4g6hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:35:8:57base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1001T1T1T00TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010010000000110011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000110010000000010001001
Bit length21 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits15within that length
Bit parityeven6 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
Bytes319 00 89
Gray code101011000000011001101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000110010000000010001001
64-bit0000000000000000000000000000000000000000000110010000000010001001
One's complement11111111111001101111111101110110at 32 bits, every bit flipped
Bits reversed10010001000000001001100000000000at 32 bits
Rotated left by 100000000001100100000000100010010at 32 bits, wrapping
Shifted left by 11100100000000100010010= 3,277,074, no wrap
Shifted right by 111001000000001000100= 819,268, discarding the low bit
These bits as a double8.09544841 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,638,547+10
Previous prime1,638,487−50
Distance to nearest prime10
Nearest square below1,638,400
Nearest square above1,640,961

Powers & multiples

1,638,537 to the power 22,684,803,500,369
1,638,537 to the power 34,399,149,873,084,120,153
1,638,537 to the power 47,208,169,835,593,634,983,136,161
1,638,537 to the power 511,810,852,977,904,087,884,362,975,836,457
First ten multiples1,638,537, 3,277,074, 4,915,611, 6,554,148, 8,192,685, 9,831,222, 11,469,759, 13,108,296, 14,746,833, 16,385,370
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1375the total stopping time
Highest value reached25,224,85615× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,638,537 → 4,915,612 → 2,457,806 → 1,228,903 → 3,686,710 → 1,843,355 → 5,530,066 → 2,765,033 → 8,295,100 → 4,147,550 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage163,853,700%
1,638,537% as a decimal16,385.37
1,638,537% of 1001,638,537
1,638,537% of 1,00016,385,370
As a fraction of 1001,638,537/100

Read another way

As bytes1.563 MiB
As a 24-bit colour#190089

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