Recognised as Number

1,507,376

Positive
Even
Composite
7 digits

1,507,376 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,507,376

Digit count7

Digit sum29

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation2^4 × 13 × 7,247

Distinct prime factors32, 13, 7,247

Number of divisors20

Sum of divisors σ(n)3,145,632

Aliquot sum1,638,256sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)43,476the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 695,616

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 13, 16, 26, 52, 104, 208, 7,247, 14,494, 28,988, 57,976, 94,211, 115,952, 188,422, 376,844, 753,688, 1,507,37620 in total

Arithmetic

Previous number1,507,375

Next number1,507,377

Double3,014,752

Half753,688

Square2,272,182,405,376

Cube3,425,033,225,486,053,376

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

Cube root114.658748927≈

Negation-1,507,376

Reciprocal6.63404486 × 10^-7≈

Representations

Decimal1,507,376

Binary10111000000000011000021 bits

Octal5600060

Hexadecimal170030

Base 36WB3K

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

In wordsone million, five hundred and seven thousand, three hundred and seventy-six

Ordinalone million, five hundred and seven thousand, three hundred and seventy-sixth

Scientific notation1.507376 × 10^6

Engineering notation1.507376 × 10^6

In other bases

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

Quinary341214001base 5; one hand: 9 digits

Septenary15545453base 7: 8 digits

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

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

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

Sexagesimal6:58:42:56base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101110000000000110000

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 even

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 44 trailing zeros

Power of twoNo

Bytes317 00 30

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

At each machine width

32-bit00000000000101110000000000110000

64-bit0000000000000000000000000000000000000000000101110000000000110000

One's complement11111111111010001111111111001111at 32 bits, every bit flipped

Bits reversed00001100000000001110100000000000at 32 bits

Rotated left by 100000000001011100000000001100000at 32 bits, wrapping

Shifted left by 11011100000000001100000= 3,014,752, no wrap

Shifted right by 110111000000000011000= 753,688, discarding the low bit

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

Nearest landmarks

Next prime1,507,379+3

Previous prime1,507,369−7

Distance to nearest prime3

Nearest square below1,505,529

Nearest square above1,507,984

Powers & multiples

1,507,376 to the power 22,272,182,405,376

1,507,376 to the power 33,425,033,225,486,053,376

1,507,376 to the power 45,162,812,883,300,265,193,701,376

1,507,376 to the power 57,782,300,232,777,620,546,620,805,349,376

First ten multiples1,507,376, 3,014,752, 4,522,128, 6,029,504, 7,536,880, 9,044,256, 10,551,632, 12,059,008, 13,566,384, 15,073,760

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 1

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8Yes

Divisible by 9No, remainder 2

Divisible by 10No, remainder 6

Divisible by 11No, remainder 2

Divisible by 12No, remainder 8

Divisible by 100No, remainder 76

Collatz (3n + 1) trajectory

Steps to reach 162the total stopping time

Highest value reached1,507,376

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

First steps1,507,376 → 753,688 → 376,844 → 188,422 → 94,211 → 282,634 → 141,317 → 423,952 → 211,976 → 105,988 → …

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

As a percentage & fraction

As a percentage150,737,600%

1,507,376% as a decimal15,073.76

1,507,376% of 1001,507,376

1,507,376% of 1,00015,073,760

As a fraction of 1001,507,376/100

Read another way

As seconds17 days, 10 hours and 42 minutes

As bytes1.438 MiB

As a 24-bit colour#170030

Keep nerding

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