Recognised as Number

1,526,361

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,526,361

Digit count7

Digit sum24

Digit product1,080

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 37 × 13,751

Distinct prime factors33, 37, 13,751

Number of divisors8

Sum of divisors σ(n)2,090,304

Aliquot sum563,943sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)990,000integers below n that share no factor with it

Carmichael function λ(n)247,500the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 990,000

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 37, 111, 13,751, 41,253, 508,787, 1,526,3618 in total

Arithmetic

Previous number1,526,360

Next number1,526,362

Double3,052,722

Half763,180.5

Square2,329,777,902,321

Cube3,556,082,128,764,583,881

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

Cube root115.138107547≈

Negation-1,526,361

Reciprocal6.55153008 × 10^-7≈

Representations

Decimal1,526,361

Binary10111010010100101100121 bits

Octal5645131

Hexadecimal174A59

Base 36WPQX

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

In wordsone million, five hundred and twenty-six thousand, three hundred and sixty-one

Ordinalone million, five hundred and twenty-six thousand, three hundred and sixty-first

Scientific notation1.526361 × 10^6

Engineering notation1.526361 × 10^6

In other bases

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

Quinary342320421base 5; one hand: 9 digits

Septenary15655014base 7: 8 digits

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

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

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

Sexagesimal7:3:59:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101110100101001011001

Bit length21 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits10within that length

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

Bytes317 4a 59

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

At each machine width

32-bit00000000000101110100101001011001

64-bit0000000000000000000000000000000000000000000101110100101001011001

One's complement11111111111010001011010110100110at 32 bits, every bit flipped

Bits reversed10011010010100101110100000000000at 32 bits

Rotated left by 100000000001011101001010010110010at 32 bits, wrapping

Shifted left by 11011101001010010110010= 3,052,722, no wrap

Shifted right by 110111010010100101100= 763,180, discarding the low bit

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

Nearest landmarks

Next prime1,526,363+2

Previous prime1,526,351−10

Distance to nearest prime2

Nearest square below1,525,225

Nearest square above1,527,696

Powers & multiples

1,526,361 to the power 22,329,777,902,321

1,526,361 to the power 33,556,082,128,764,583,881

1,526,361 to the power 45,427,865,074,143,239,017,187,041

1,526,361 to the power 58,284,881,562,434,348,449,512,629,087,801

First ten multiples1,526,361, 3,052,722, 4,579,083, 6,105,444, 7,631,805, 9,158,166, 10,684,527, 12,210,888, 13,737,249, 15,263,610

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 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 6

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1163the total stopping time

Highest value reached5,151,4723× the starting value

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

First steps1,526,361 → 4,579,084 → 2,289,542 → 1,144,771 → 3,434,314 → 1,717,157 → 5,151,472 → 2,575,736 → 1,287,868 → 643,934 → …

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

As a percentage & fraction

As a percentage152,636,100%

1,526,361% as a decimal15,263.61

1,526,361% of 1001,526,361

1,526,361% of 1,00015,263,610

As a fraction of 1001,526,361/100

Read another way

As seconds17 days, 15 hours and 59 minutes

As bytes1.456 MiB

As a 24-bit colour#174A59

Keep nerding

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