Recognised as Number

1,533,035

Positive
Odd
Composite
7 digits

1,533,035 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,533,035

Digit count7

Digit sum20

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 factorisation5 × 7 × 43,801

Distinct prime factors35, 7, 43,801

Number of divisors8

Sum of divisors σ(n)2,102,496

Aliquot sum569,461sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 7, 35, 43,801, 219,005, 306,607, 1,533,0358 in total

Arithmetic

Previous number1,533,034

Next number1,533,036

Double3,066,070

Half766,517.5

Square2,350,196,311,225

Cube3,602,933,201,978,817,875

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

Cube root115.305677005≈

Negation-1,533,035

Reciprocal6.52300828 × 10^-7≈

Representations

Decimal1,533,035

Binary10111011001000110101121 bits

Octal5662153

Hexadecimal17646B

Base 36WUWB

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

In wordsone million, five hundred and thirty-three thousand and thirty-five

Ordinalone million, five hundred and thirty-three thousand and thirty-fifth

Scientific notation1.533035 × 10^6

Engineering notation1.533035 × 10^6

In other bases

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

Quinary343024120base 5; one hand: 9 digits

Septenary16013330base 7: 8 digits

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

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

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

Sexagesimal7:5:50:35base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101110110010001101011

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

Bit parityeven12 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 64 6b

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

At each machine width

32-bit00000000000101110110010001101011

64-bit0000000000000000000000000000000000000000000101110110010001101011

One's complement11111111111010001001101110010100at 32 bits, every bit flipped

Bits reversed11010110001001101110100000000000at 32 bits

Rotated left by 100000000001011101100100011010110at 32 bits, wrapping

Shifted left by 11011101100100011010110= 3,066,070, no wrap

Shifted right by 110111011001000110101= 766,517, discarding the low bit

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

Nearest landmarks

Next prime1,533,041+6

Previous prime1,533,029−6

Distance to nearest prime6

Nearest square below1,532,644

Nearest square above1,535,121

Powers & multiples

1,533,035 to the power 22,350,196,311,225

1,533,035 to the power 33,602,933,201,978,817,875

1,533,035 to the power 45,523,422,701,295,597,061,000,625

1,533,035 to the power 58,467,600,320,880,695,640,411,093,146,875

First ten multiples1,533,035, 3,066,070, 4,599,105, 6,132,140, 7,665,175, 9,198,210, 10,731,245, 12,264,280, 13,797,315, 15,330,350

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 5Yes

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 3

Divisible by 9No, remainder 2

Divisible by 10No, remainder 5

Divisible by 11No, remainder 9

Divisible by 12No, remainder 11

Divisible by 100No, remainder 35

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time

Highest value reached9,323,7286× the starting value

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

First steps1,533,035 → 4,599,106 → 2,299,553 → 6,898,660 → 3,449,330 → 1,724,665 → 5,173,996 → 2,586,998 → 1,293,499 → 3,880,498 → …

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

As a percentage & fraction

As a percentage153,303,500%

1,533,035% as a decimal15,330.35

1,533,035% of 1001,533,035

1,533,035% of 1,00015,330,350

As a fraction of 1001,533,035/100

Read another way

As seconds17 days, 17 hours and 50 minutes

As bytes1.462 MiB

As a 24-bit colour#17646B

Keep nerding

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