Recognised as Number

1,506,735

Positive
Odd
Composite
7 digits

1,506,735 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,506,735

Digit count7

Digit sum27

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^3 × 5 × 11,161

Distinct prime factors33, 5, 11,161

Number of divisors16

Sum of divisors σ(n)2,678,880

Aliquot sum1,172,145sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 9, 15, 27, 45, 135, 11,161, 33,483, 55,805, 100,449, 167,415, 301,347, 502,245, 1,506,73516 in total

Arithmetic

Previous number1,506,734

Next number1,506,736

Double3,013,470

Half753,367.5

Square2,270,250,360,225

Cube3,420,665,676,513,615,375

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

Cube root114.642494041≈

Negation-1,506,735

Reciprocal6.63686713 × 10^-7≈

Representations

Decimal1,506,735

Binary10110111111011010111121 bits

Octal5576657

Hexadecimal16FDAF

Base 36WALR

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

In wordsone million, five hundred and six thousand, seven hundred and thirty-five

Ordinalone million, five hundred and six thousand, seven hundred and thirty-fifth

Scientific notation1.506735 × 10^6

Engineering notation1.506735 × 10^6

In other bases

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

Quinary341203420base 5; one hand: 9 digits

Septenary15543546base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101101111110110101111

Bit length21 bitsto write the magnitude

Set bits16the population count, or Hamming weight

Zero bits5within that length

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

Bytes316 fd af

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

At each machine width

32-bit00000000000101101111110110101111

64-bit0000000000000000000000000000000000000000000101101111110110101111

One's complement11111111111010010000001001010000at 32 bits, every bit flipped

Bits reversed11110101101111110110100000000000at 32 bits

Rotated left by 100000000001011011111101101011110at 32 bits, wrapping

Shifted left by 11011011111101101011110= 3,013,470, no wrap

Shifted right by 110110111111011010111= 753,367, discarding the low bit

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

Nearest landmarks

Next prime1,506,749+14

Previous prime1,506,733−2

Distance to nearest prime2

Nearest square below1,505,529

Nearest square above1,507,984

Powers & multiples

1,506,735 to the power 22,270,250,360,225

1,506,735 to the power 33,420,665,676,513,615,375

1,506,735 to the power 45,154,036,698,101,742,262,050,625

1,506,735 to the power 57,765,767,484,314,328,627,210,848,459,375

First ten multiples1,506,735, 3,013,470, 4,520,205, 6,026,940, 7,533,675, 9,040,410, 10,547,145, 12,053,880, 13,560,615, 15,067,350

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 3

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 6

Divisible by 8No, remainder 7

Divisible by 9Yes

Divisible by 10No, remainder 5

Divisible by 11No, remainder 10

Divisible by 12No, remainder 3

Divisible by 100No, remainder 35

Collatz (3n + 1) trajectory

Steps to reach 1163the total stopping time

Highest value reached117,428,77677× the starting value

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

First steps1,506,735 → 4,520,206 → 2,260,103 → 6,780,310 → 3,390,155 → 10,170,466 → 5,085,233 → 15,255,700 → 7,627,850 → 3,813,925 → …

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

As a percentage & fraction

As a percentage150,673,500%

1,506,735% as a decimal15,067.35

1,506,735% of 1001,506,735

1,506,735% of 1,00015,067,350

As a fraction of 1001,506,735/100

Read another way

As seconds17 days, 10 hours and 32 minutes

As bytes1.437 MiB

As a 24-bit colour#16FDAF

Keep nerding

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