Nerdulator> put something in

Recognised as Number

1,531,993

  • Positive
  • Odd
  • Composite
  • 7 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,531,993
Digit count7
Digit sum31
Digit product3,645
Multiplicative persistence3times 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 factorisation571 × 2,683
Distinct prime factors2571, 2,683
Number of divisors4
Sum of divisors σ(n)1,535,248
Aliquot sum3,255sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,528,740integers below n that share no factor with it
Carmichael function λ(n)254,790the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,528,740
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 571, 2,683, 1,531,9934 in total

Arithmetic

Previous number1,531,992
Next number1,531,994
Double3,063,986
Cube3,595,591,480,721,203,657
Square root1,237.737048003≈irrational, shown to 9 decimal places
Cube root115.279546759≈
Negation-1,531,993
Reciprocal6.52744497 × 10^-7≈

Representations

Decimal1,531,993
Binary10111011000000101100121 bits
Octal5660131
Hexadecimal176059
Base 36WU3D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and thirty-one thousand, nine hundred and ninety-three
Ordinalone million, five hundred and thirty-one thousand, nine hundred and ninety-third
Scientific notation1.531993 × 10^6
Engineering notation1.531993 × 10^6

In other bases

Ternary2212211111111base 3; the most digit-efficient integer base after e: 13 digits
Quinary343010433base 5; one hand: 9 digits
Septenary16010311base 7: 8 digits
Nonary2784444base 9; each digit is two ternary digits: 7 digits
Duodecimal61a6a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9b9jdbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:5:33:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T0T11111111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010001010000110101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101110110000001011001
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
Bytes317 60 59
Gray code111001101000001110101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101110110000001011001
64-bit0000000000000000000000000000000000000000000101110110000001011001
One's complement11111111111010001001111110100110at 32 bits, every bit flipped
Bits reversed10011010000001101110100000000000at 32 bits
Rotated left by 100000000001011101100000010110010at 32 bits, wrapping
Shifted left by 11011101100000010110010= 3,063,986, no wrap
Shifted right by 110111011000000101100= 765,996, discarding the low bit
These bits as a double7.56905111 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,531,997+4
Previous prime1,531,991−2
Distance to nearest prime2
Nearest square below1,530,169
Nearest square above1,532,644

Powers & multiples

1,531,993 to the power 22,347,002,552,049
1,531,993 to the power 33,595,591,480,721,203,657
1,531,993 to the power 45,508,420,979,324,518,954,098,401
1,531,993 to the power 58,438,862,381,378,307,766,046,071,643,193
First ten multiples1,531,993, 3,063,986, 4,595,979, 6,127,972, 7,659,965, 9,191,958, 10,723,951, 12,255,944, 13,787,937, 15,319,930
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 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 93

Collatz (3n + 1) trajectory

Steps to reach 1163the total stopping time
Highest value reached5,170,4803× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,531,993 → 4,595,980 → 2,297,990 → 1,148,995 → 3,446,986 → 1,723,493 → 5,170,480 → 2,585,240 → 1,292,620 → 646,310 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage153,199,300%
1,531,993% as a decimal15,319.93
1,531,993% of 1001,531,993
1,531,993% of 1,00015,319,930
As a fraction of 1001,531,993/100

Read another way

As bytes1.461 MiB
As a 24-bit colour#176059

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