Nerdulator> put something in

Recognised as Number

1,342,339

  • Positive
  • Odd
  • Prime
  • 7 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,342,339
Digit count7
Digit sum25
Digit product1,944
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,342,339
Distinct prime factors11,342,339
Number of divisors2
Sum of divisors σ(n)1,342,340
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,342,338integers below n that share no factor with it
Carmichael function λ(n)1,342,338the 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,342,3392 in total

Arithmetic

Previous number1,342,338
Next number1,342,340
Double2,684,678
Cube2,418,725,731,098,904,219
Square root1,158.593543914≈irrational, shown to 9 decimal places
Cube root110.31148628≈
Negation-1,342,339
Reciprocal7.44968298 × 10^-7≈

Representations

Decimal1,342,339
Binary10100011110111000001121 bits
Octal5075603
Hexadecimal147B83
Base 36SRR7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and forty-two thousand, three hundred and thirty-nine
Ordinalone million, three hundred and forty-two thousand, three hundred and thirty-ninth
Scientific notation1.342339 × 10^6
Engineering notation1.342339 × 10^6

In other bases

Ternary2112012100021base 3; the most digit-efficient integer base after e: 13 digits
Quinary320423324base 5; one hand: 9 digits
Septenary14260345base 7: 8 digits
Nonary2465307base 9; each digit is two ternary digits: 7 digits
Duodecimal548997base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal87fgjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:12:52:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT1TT1001T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011000110010000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101000111101110000011
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 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 7b 83
Gray code111100100011001000010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101000111101110000011
64-bit0000000000000000000000000000000000000000000101000111101110000011
One's complement11111111111010111000010001111100at 32 bits, every bit flipped
Bits reversed11000001110111100010100000000000at 32 bits
Rotated left by 100000000001010001111011100000110at 32 bits, wrapping
Shifted left by 11010001111011100000110= 2,684,678, no wrap
Shifted right by 110100011110111000001= 671,169, discarding the low bit
These bits as a double6.63203585 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,342,343+4
Previous prime1,342,333−6
Distance to nearest prime0, it is prime
Nearest square below1,340,964
Nearest square above1,343,281

Powers & multiples

1,342,339 to the power 21,801,873,990,921
1,342,339 to the power 32,418,725,731,098,904,219
1,342,339 to the power 43,246,749,879,157,571,990,428,241
1,342,339 to the power 54,358,238,986,038,496,028,059,454,595,699
First ten multiples1,342,339, 2,684,678, 4,027,017, 5,369,356, 6,711,695, 8,054,034, 9,396,373, 10,738,712, 12,081,051, 13,423,390
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 39

Collatz (3n + 1) trajectory

Steps to reach 198the total stopping time
Highest value reached6,040,5284× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,342,339 → 4,027,018 → 2,013,509 → 6,040,528 → 3,020,264 → 1,510,132 → 755,066 → 377,533 → 1,132,600 → 566,300 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage134,233,900%
1,342,339% as a decimal13,423.39
1,342,339% of 1001,342,339
1,342,339% of 1,00013,423,390
As a fraction of 1001,342,339/100

Read another way

As bytes1.28 MiB
As a 24-bit colour#147B83

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “1342339” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.