Nerdulator> put something in

Recognised as Number

1,405,939

  • Positive
  • Odd
  • Prime
  • 7 digits

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

Arithmetic

Previous number1,405,938
Next number1,405,940
Double2,811,878
Cube2,779,069,670,706,951,019
Square root1,185.722986199≈irrational, shown to 9 decimal places
Cube root112.026858992≈
Negation-1,405,939
Reciprocal7.11268412 × 10^-7≈

Representations

Decimal1,405,939
Binary10101011100111111001121 bits
Octal5271763
Hexadecimal1573F3
Base 36U4TV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and five thousand, nine hundred and thirty-nine
Ordinalone million, four hundred and five thousand, nine hundred and thirty-ninth
Scientific notation1.405939 × 10^6
Engineering notation1.405939 × 10^6

In other bases

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

Bit-level

00000000000101010111001111110011
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 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
Bytes315 73 f3
Gray code111111100101000001010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101010111001111110011
64-bit0000000000000000000000000000000000000000000101010111001111110011
One's complement11111111111010101000110000001100at 32 bits, every bit flipped
Bits reversed11001111110011101010100000000000at 32 bits
Rotated left by 100000000001010101110011111100110at 32 bits, wrapping
Shifted left by 11010101110011111100110= 2,811,878, no wrap
Shifted right by 110101011100111111001= 702,969, discarding the low bit
These bits as a double6.9462616 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,405,979+40
Previous prime1,405,927−12
Distance to nearest prime0, it is prime
Nearest square below1,404,225
Nearest square above1,406,596

Powers & multiples

1,405,939 to the power 21,976,664,471,721
1,405,939 to the power 32,779,069,670,706,951,019
1,405,939 to the power 43,907,202,433,764,060,008,701,841
1,405,939 to the power 55,493,288,282,523,808,764,574,257,633,699
First ten multiples1,405,939, 2,811,878, 4,217,817, 5,623,756, 7,029,695, 8,435,634, 9,841,573, 11,247,512, 12,653,451, 14,059,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 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 39

Collatz (3n + 1) trajectory

Steps to reach 1305the total stopping time
Highest value reached487,463,344346× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,405,939 → 4,217,818 → 2,108,909 → 6,326,728 → 3,163,364 → 1,581,682 → 790,841 → 2,372,524 → 1,186,262 → 593,131 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage140,593,900%
1,405,939% as a decimal14,059.39
1,405,939% of 1001,405,939
1,405,939% of 1,00014,059,390
As a fraction of 1001,405,939/100

Read another way

As bytes1.341 MiB
As a 24-bit colour#1573F3

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