Recognised as Number

1,597,213

Positive
Odd
Composite
7 digits

1,597,213 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,597,213

Digit count7

Digit sum28

Digit product1,890

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation31 × 67 × 769

Distinct prime factors331, 67, 769

Number of divisors8

Sum of divisors σ(n)1,675,520

Aliquot sum78,307sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,520,640integers below n that share no factor with it

Carmichael function λ(n)42,240the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,520,640

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 31, 67, 769, 2,077, 23,839, 51,523, 1,597,2138 in total

Arithmetic

Previous number1,597,212

Next number1,597,214

Double3,194,426

Half798,606.5

Square2,551,089,367,369

Cube4,074,633,101,723,542,597

Square root1,263.808925431≈irrational, shown to 9 decimal places

Cube root116.892759748≈

Negation-1,597,213

Reciprocal6.26090572 × 10^-7≈

Representations

Decimal1,597,213

Binary11000010111110001110121 bits

Octal6057435

Hexadecimal185F1D

Base 36Y8F1

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, five hundred and ninety-seven thousand, two hundred and thirteen

Ordinalone million, five hundred and ninety-seven thousand, two hundred and thirteenth

Scientific notation1.597213 × 10^6

Engineering notation1.597213 × 10^6

In other bases

Ternary10000010222001base 3; the most digit-efficient integer base after e: 14 digits

Quinary402102323base 5; one hand: 9 digits

Septenary16401412base 7: 8 digits

Nonary3003861base 9; each digit is two ternary digits: 7 digits

Duodecimal650391base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal9jd0dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal7:23:40:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1000001100T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11010011010001101101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000110000101111100011101

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

Bit parityeven12 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

Bytes318 5f 1d

Gray code101000111000010010011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000110000101111100011101

64-bit0000000000000000000000000000000000000000000110000101111100011101

One's complement11111111111001111010000011100010at 32 bits, every bit flipped

Bits reversed10111000111110100001100000000000at 32 bits

Rotated left by 100000000001100001011111000111010at 32 bits, wrapping

Shifted left by 11100001011111000111010= 3,194,426, no wrap

Shifted right by 111000010111110001110= 798,606, discarding the low bit

These bits as a double7.89128072 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,597,229+16

Previous prime1,597,187−26

Distance to nearest prime16

Nearest square below1,595,169

Nearest square above1,597,696

Powers & multiples

1,597,213 to the power 22,551,089,367,369

1,597,213 to the power 34,074,633,101,723,542,597

1,597,213 to the power 46,508,056,960,303,164,641,982,161

1,597,213 to the power 510,394,753,181,736,698,507,314,253,317,293

First ten multiples1,597,213, 3,194,426, 4,791,639, 6,388,852, 7,986,065, 9,583,278, 11,180,491, 12,777,704, 14,374,917, 15,972,130

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 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 3

Divisible by 11No, remainder 2

Divisible by 12No, remainder 1

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1101the total stopping time

Highest value reached4,791,6403× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,597,213 → 4,791,640 → 2,395,820 → 1,197,910 → 598,955 → 1,796,866 → 898,433 → 2,695,300 → 1,347,650 → 673,825 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage159,721,300%

1,597,213% as a decimal15,972.13

1,597,213% of 1001,597,213

1,597,213% of 1,00015,972,130

As a fraction of 1001,597,213/100

Read another way

As seconds18 days, 11 hours and 40 minutes

As bytes1.523 MiB

As a 24-bit colour#185F1D

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.