Recognised as Number

1,329,437

Positive
Odd
Prime
7 digits

1,329,437 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,329,437

Digit count7

Digit sum29

Digit product4,536

Multiplicative persistence3times 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 factorisation1,329,437

Distinct prime factors11,329,437

Number of divisors2

Sum of divisors σ(n)1,329,438

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,329,436the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 1,329,4372 in total

Arithmetic

Previous number1,329,436

Next number1,329,438

Double2,658,874

Half664,718.5

Square1,767,402,736,969

Cube2,349,650,592,427,856,453

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

Cube root109.956925283≈

Negation-1,329,437

Reciprocal7.52198111 × 10^-7≈

Representations

Decimal1,329,437

Binary10100010010010001110121 bits

Octal5044435

Hexadecimal14491D

Base 36SHST

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

In wordsone million, three hundred and twenty-nine thousand, four hundred and thirty-seven

Ordinalone million, three hundred and twenty-nine thousand, four hundred and thirty-seventh

Scientific notation1.329437 × 10^6

Engineering notation1.329437 × 10^6

In other bases

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

Quinary320020222base 5; one hand: 9 digits

Septenary14204624base 7: 8 digits

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

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

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

Sexagesimal6:9:17:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101000100100100011101

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

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

Bytes314 49 1d

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

At each machine width

32-bit00000000000101000100100100011101

64-bit0000000000000000000000000000000000000000000101000100100100011101

One's complement11111111111010111011011011100010at 32 bits, every bit flipped

Bits reversed10111000100100100010100000000000at 32 bits

Rotated left by 100000000001010001001001000111010at 32 bits, wrapping

Shifted left by 11010001001001000111010= 2,658,874, no wrap

Shifted right by 110100010010010001110= 664,718, discarding the low bit

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

Nearest landmarks

Next prime1,329,439+2

Previous prime1,329,407−30

Distance to nearest prime0, it is prime

Nearest square below1,329,409

Nearest square above1,331,716

Powers & multiples

1,329,437 to the power 21,767,402,736,969

1,329,437 to the power 32,349,650,592,427,856,453

1,329,437 to the power 43,123,712,434,645,512,199,306,961

1,329,437 to the power 54,152,778,887,977,825,801,710,048,310,957

First ten multiples1,329,437, 2,658,874, 3,988,311, 5,317,748, 6,647,185, 7,976,622, 9,306,059, 10,635,496, 11,964,933, 13,294,370

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 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 7

Divisible by 11No, remainder 10

Divisible by 12No, remainder 5

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 180the total stopping time

Highest value reached3,988,3123× the starting value

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

First steps1,329,437 → 3,988,312 → 1,994,156 → 997,078 → 498,539 → 1,495,618 → 747,809 → 2,243,428 → 1,121,714 → 560,857 → …

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

As a percentage & fraction

As a percentage132,943,700%

1,329,437% as a decimal13,294.37

1,329,437% of 1001,329,437

1,329,437% of 1,00013,294,370

As a fraction of 1001,329,437/100

Read another way

As seconds15 days, 9 hours and 17 minutes

As bytes1.268 MiB

As a 24-bit colour#14491D

Keep nerding

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