Recognised as Number
1,329,313
- Positive
- Odd
- Prime
- 7 digits
1,329,313 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,329,313
Digit count7
Digit sum22
Digit product486
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,329,313
Distinct prime factors11,329,313
Number of divisors2
Sum of divisors σ(n)1,329,314
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,329,312integers below n that share no factor with it
Carmichael function λ(n)1,329,312the 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,3132 in total
Arithmetic
Previous number1,329,312
Next number1,329,314
Double2,658,626
Half664,656.5
Square1,767,073,051,969
Cube2,348,993,179,932,067,297
Square root1,152.958368719≈irrational, shown to 9 decimal places
Cube root109.953506522≈
Negation-1,329,313
Reciprocal7.52268277 × 10^-7≈
Representations
Decimal1,329,313
Binary10100010010001010000121 bits
Octal5044241
Hexadecimal1448A1
Base 36SHPD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and twenty-nine thousand, three hundred and thirteen
Ordinalone million, three hundred and twenty-nine thousand, three hundred and thirteenth
Scientific notation1.329313 × 10^6
Engineering notation1.329313 × 10^6
In other bases
Ternary2111112110211base 3; the most digit-efficient integer base after e: 13 digits
Quinary320014223base 5; one hand: 9 digits
Septenary14204356base 7: 8 digits
Nonary2445424base 9; each digit is two ternary digits: 7 digits
Duodecimal541341base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8635dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:9:15:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTTTT111T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000101100111100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000100100010100001
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 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 48 a1
Gray code111100110110011110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000100100010100001
64-bit0000000000000000000000000000000000000000000101000100100010100001
One's complement11111111111010111011011101011110at 32 bits, every bit flipped
Bits reversed10000101000100100010100000000000at 32 bits
Rotated left by 100000000001010001001000101000010at 32 bits, wrapping
Shifted left by 11010001001000101000010= 2,658,626, no wrap
Shifted right by 110100010010001010000= 664,656, discarding the low bit
These bits as a double6.56767886 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,329,313 to the power 21,767,073,051,969
1,329,313 to the power 32,348,993,179,932,067,297
1,329,313 to the power 43,122,547,170,995,036,174,776,961
1,329,313 to the power 54,150,842,547,516,924,522,601,286,357,793
First ten multiples1,329,313, 2,658,626, 3,987,939, 5,317,252, 6,646,565, 7,975,878, 9,305,191, 10,634,504, 11,963,817, 13,293,130
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1248the total stopping time
Highest value reached46,045,09634× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,329,313 → 3,987,940 → 1,993,970 → 996,985 → 2,990,956 → 1,495,478 → 747,739 → 2,243,218 → 1,121,609 → 3,364,828 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage132,931,300%
1,329,313% as a decimal13,293.13
1,329,313% of 1001,329,313
1,329,313% of 1,00013,293,130
As a fraction of 1001,329,313/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,329,313
Nerdulate something else
Nothing in mind? Surprise me · today’s page