Nerdulator> put something in

Recognised as Number

1,320,437

  • Positive
  • Odd
  • Prime
  • 7 digits

1,320,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,320,437
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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,320,437
Distinct prime factors11,320,437
Number of divisors2
Sum of divisors σ(n)1,320,438
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,320,436integers below n that share no factor with it
Carmichael function λ(n)1,320,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,320,4372 in total

Arithmetic

Previous number1,320,436
Next number1,320,438
Double2,640,874
Cube2,302,253,042,720,693,453
Square root1,149.102693409≈irrational, shown to 9 decimal places
Cube root109.708235069≈
Negation-1,320,437
Reciprocal7.57325037 × 10^-7≈

Representations

Decimal1,320,437
Binary10100001001011111010121 bits
Octal5022765
Hexadecimal1425F5
Base 36SAUT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and twenty thousand, four hundred and thirty-seven
Ordinalone million, three hundred and twenty thousand, four hundred and thirty-seventh
Scientific notation1.320437 × 10^6
Engineering notation1.320437 × 10^6

In other bases

Ternary2111002022002base 3; the most digit-efficient integer base after e: 13 digits
Quinary314223222base 5; one hand: 9 digits
Septenary14136446base 7: 8 digits
Nonary2432262base 9; each digit is two ternary digits: 7 digits
Duodecimal538185base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8511hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:6:47:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11101T10T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000111101000110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101000010010111110101
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 25 f5
Gray code111100011011100001111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101000010010111110101
64-bit0000000000000000000000000000000000000000000101000010010111110101
One's complement11111111111010111101101000001010at 32 bits, every bit flipped
Bits reversed10101111101001000010100000000000at 32 bits
Rotated left by 100000000001010000100101111101010at 32 bits, wrapping
Shifted left by 11010000100101111101010= 2,640,874, no wrap
Shifted right by 110100001001011111010= 660,218, discarding the low bit
These bits as a double6.52382559 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,320,533+96
Previous prime1,320,433−4
Distance to nearest prime0, it is prime
Nearest square below1,320,201
Nearest square above1,322,500

Powers & multiples

1,320,437 to the power 21,743,553,870,969
1,320,437 to the power 32,302,253,042,720,693,453
1,320,437 to the power 43,039,980,100,970,984,300,998,961
1,320,437 to the power 54,014,102,204,585,823,597,458,165,065,957
First ten multiples1,320,437, 2,640,874, 3,961,311, 5,281,748, 6,602,185, 7,922,622, 9,243,059, 10,563,496, 11,883,933, 13,204,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 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 193the total stopping time
Highest value reached3,961,3123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,320,437 → 3,961,312 → 1,980,656 → 990,328 → 495,164 → 247,582 → 123,791 → 371,374 → 185,687 → 557,062 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage132,043,700%
1,320,437% as a decimal13,204.37
1,320,437% of 1001,320,437
1,320,437% of 1,00013,204,370
As a fraction of 1001,320,437/100

Read another way

As bytes1.259 MiB
As a 24-bit colour#1425F5

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 “1320437” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.