Recognised as Number

1,352,005

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,352,005

Digit count7

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 317 × 853

Distinct prime factors35, 317, 853

Number of divisors8

Sum of divisors σ(n)1,629,432

Aliquot sum277,427sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)67,308the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,076,928

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 317, 853, 1,585, 4,265, 270,401, 1,352,0058 in total

Arithmetic

Previous number1,352,004

Next number1,352,006

Double2,704,010

Half676,002.5

Square1,827,917,520,025

Cube2,471,353,626,661,400,125

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

Cube root110.575632584≈

Negation-1,352,005

Reciprocal7.39642235 × 10^-7≈

Representations

Decimal1,352,005

Binary10100101000010100010121 bits

Octal5120505

Hexadecimal14A145

Base 36SZ7P

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

In wordsone million, three hundred and fifty-two thousand and five

Ordinalone million, three hundred and fifty-two thousand and fifth

Scientific notation1.352005 × 10^6

Engineering notation1.352005 × 10^6

In other bases

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

Quinary321231010base 5; one hand: 9 digits

Septenary14330464base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101001010000101000101

Bit length21 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits13within that length

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

Bytes314 a1 45

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

At each machine width

32-bit00000000000101001010000101000101

64-bit0000000000000000000000000000000000000000000101001010000101000101

One's complement11111111111010110101111010111010at 32 bits, every bit flipped

Bits reversed10100010100001010010100000000000at 32 bits

Rotated left by 100000000001010010100001010001010at 32 bits, wrapping

Shifted left by 11010010100001010001010= 2,704,010, no wrap

Shifted right by 110100101000010100010= 676,002, discarding the low bit

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

Nearest landmarks

Next prime1,352,069+64

Previous prime1,351,997−8

Distance to nearest prime8

Nearest square below1,350,244

Nearest square above1,352,569

Powers & multiples

1,352,005 to the power 21,827,917,520,025

1,352,005 to the power 32,471,353,626,661,400,125

1,352,005 to the power 43,341,282,460,014,346,276,000,625

1,352,005 to the power 54,517,430,592,351,696,236,884,225,003,125

First ten multiples1,352,005, 2,704,010, 4,056,015, 5,408,020, 6,760,025, 8,112,030, 9,464,035, 10,816,040, 12,168,045, 13,520,050

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

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 5

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 5

Collatz (3n + 1) trajectory

Steps to reach 1292the total stopping time

Highest value reached9,635,9207× the starting value

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

First steps1,352,005 → 4,056,016 → 2,028,008 → 1,014,004 → 507,002 → 253,501 → 760,504 → 380,252 → 190,126 → 95,063 → …

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

As a percentage & fraction

As a percentage135,200,500%

1,352,005% as a decimal13,520.05

1,352,005% of 1001,352,005

1,352,005% of 1,00013,520,050

As a fraction of 1001,352,005/100

Read another way

As seconds15 days, 15 hours and 33 minutes

As bytes1.289 MiB

As a 24-bit colour#14A145

Keep nerding

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