Recognised as Number

1,591,463

Positive
Odd
Prime
7 digits

1,591,463 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,591,463

Digit count7

Digit sum29

Digit product3,240

Multiplicative persistence2times 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,591,463

Distinct prime factors11,591,463

Number of divisors2

Sum of divisors σ(n)1,591,464

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,591,462the 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,591,4632 in total

Arithmetic

Previous number1,591,462

Next number1,591,464

Double3,182,926

Half795,731.5

Square2,532,754,480,369

Cube4,030,785,043,591,489,847

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

Cube root116.752318961≈

Negation-1,591,463

Reciprocal6.28352654 × 10^-7≈

Representations

Decimal1,591,463

Binary11000010010001010011121 bits

Octal6044247

Hexadecimal1848A7

Base 36Y3ZB

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

In wordsone million, five hundred and ninety-one thousand, four hundred and sixty-three

Ordinalone million, five hundred and ninety-one thousand, four hundred and sixty-third

Scientific notation1.591463 × 10^6

Engineering notation1.591463 × 10^6

In other bases

Ternary2222212002002base 3; the most digit-efficient integer base after e: 13 digits

Quinary401411323base 5; one hand: 9 digits

Septenary16345556base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000110000100100010100111

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

Bit parityodd9 set bits, so odd; 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 48 a7

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

At each machine width

32-bit00000000000110000100100010100111

64-bit0000000000000000000000000000000000000000000110000100100010100111

One's complement11111111111001111011011101011000at 32 bits, every bit flipped

Bits reversed11100101000100100001100000000000at 32 bits

Rotated left by 100000000001100001001000101001110at 32 bits, wrapping

Shifted left by 11100001001000101001110= 3,182,926, no wrap

Shifted right by 111000010010001010011= 795,731, discarding the low bit

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

Nearest landmarks

Next prime1,591,483+20

Previous prime1,591,441−22

Distance to nearest prime0, it is prime

Nearest square below1,590,121

Nearest square above1,592,644

Powers & multiples

1,591,463 to the power 22,532,754,480,369

1,591,463 to the power 34,030,785,043,591,489,847

1,591,463 to the power 46,414,845,257,829,243,206,376,161

1,591,463 to the power 510,208,988,878,560,700,880,949,024,313,543

First ten multiples1,591,463, 3,182,926, 4,774,389, 6,365,852, 7,957,315, 9,548,778, 11,140,241, 12,731,704, 14,323,167, 15,914,630

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 3

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 3

Divisible by 11No, remainder 5

Divisible by 12No, remainder 11

Divisible by 100No, remainder 63

Collatz (3n + 1) trajectory

Steps to reach 1238the total stopping time

Highest value reached58,074,38836× the starting value

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

First steps1,591,463 → 4,774,390 → 2,387,195 → 7,161,586 → 3,580,793 → 10,742,380 → 5,371,190 → 2,685,595 → 8,056,786 → 4,028,393 → …

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

As a percentage & fraction

As a percentage159,146,300%

1,591,463% as a decimal15,914.63

1,591,463% of 1001,591,463

1,591,463% of 1,00015,914,630

As a fraction of 1001,591,463/100

Read another way

As seconds18 days, 10 hours and 4 minutes

As bytes1.518 MiB

As a 24-bit colour#1848A7

Keep nerding

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