Recognised as Number

1,336,429

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,336,429

Digit count7

Digit sum28

Digit product3,888

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,336,429

Distinct prime factors11,336,429

Number of divisors2

Sum of divisors σ(n)1,336,430

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,336,428the 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,336,4292 in total

Arithmetic

Previous number1,336,428

Next number1,336,430

Double2,672,858

Half668,214.5

Square1,786,042,472,041

Cube2,386,918,954,867,281,589

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

Cube root110.149356343≈

Negation-1,336,429

Reciprocal7.48262721 × 10^-7≈

Representations

Decimal1,336,429

Binary10100011001000110110121 bits

Octal5062155

Hexadecimal14646D

Base 36SN71

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

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

Ordinalone million, three hundred and thirty-six thousand, four hundred and twenty-ninth

Scientific notation1.336429 × 10^6

Engineering notation1.336429 × 10^6

In other bases

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

Quinary320231204base 5; one hand: 9 digits

Septenary14234203base 7: 8 digits

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

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

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

Sexagesimal6:11:13:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101000110010001101101

Bit length21 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits11within that length

Bit parityeven10 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 64 6d

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

At each machine width

32-bit00000000000101000110010001101101

64-bit0000000000000000000000000000000000000000000101000110010001101101

One's complement11111111111010111001101110010010at 32 bits, every bit flipped

Bits reversed10110110001001100010100000000000at 32 bits

Rotated left by 100000000001010001100100011011010at 32 bits, wrapping

Shifted left by 11010001100100011011010= 2,672,858, no wrap

Shifted right by 110100011001000110110= 668,214, discarding the low bit

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

Nearest landmarks

Next prime1,336,453+24

Previous prime1,336,417−12

Distance to nearest prime0, it is prime

Nearest square below1,336,336

Nearest square above1,338,649

Powers & multiples

1,336,429 to the power 21,786,042,472,041

1,336,429 to the power 32,386,918,954,867,281,589

1,336,429 to the power 43,189,947,711,934,326,266,705,681

1,336,429 to the power 54,263,138,630,712,679,718,287,206,553,149

First ten multiples1,336,429, 2,672,858, 4,009,287, 5,345,716, 6,682,145, 8,018,574, 9,355,003, 10,691,432, 12,027,861, 13,364,290

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 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 9

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 1261the total stopping time

Highest value reached8,562,8326× the starting value

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

First steps1,336,429 → 4,009,288 → 2,004,644 → 1,002,322 → 501,161 → 1,503,484 → 751,742 → 375,871 → 1,127,614 → 563,807 → …

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

As a percentage & fraction

As a percentage133,642,900%

1,336,429% as a decimal13,364.29

1,336,429% of 1001,336,429

1,336,429% of 1,00013,364,290

As a fraction of 1001,336,429/100

Read another way

As seconds15 days, 11 hours and 13 minutes

As bytes1.275 MiB

As a 24-bit colour#14646D

Keep nerding

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