Recognised as Number
1,405,522
- Positive
- Even
- Composite
- 7 digits
1,405,522 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,405,522
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2 × 83 × 8,467
Distinct prime factors32, 83, 8,467
Number of divisors8
Sum of divisors σ(n)2,133,936
Aliquot sum728,414sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)694,212integers below n that share no factor with it
Carmichael function λ(n)347,106the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 694,212
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 83, 166, 8,467, 16,934, 702,761, 1,405,5228 in total
Arithmetic
Previous number1,405,521
Next number1,405,523
Double2,811,044
Half702,761
Square1,975,492,092,484
Cube2,776,597,596,812,296,648
Square root1,185.547131075≈irrational, shown to 9 decimal places
Cube root112.015782215≈
Negation-1,405,522
Reciprocal7.11479436 × 10^-7≈
Representations
Decimal1,405,522
Binary10101011100100101001021 bits
Octal5271122
Hexadecimal157252
Base 36U4IA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and five thousand, five hundred and twenty-two
Ordinalone million, four hundred and five thousand, five hundred and twenty-second
Scientific notation1.405522 × 10^6
Engineering notation1.405522 × 10^6
In other bases
Ternary2122102000101base 3; the most digit-efficient integer base after e: 13 digits
Quinary324434042base 5; one hand: 9 digits
Septenary14642506base 7: 8 digits
Nonary2572011base 9; each digit is two ternary digits: 7 digits
Duodecimal57946abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8fdg2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:30:25:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T11T000101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101011011001010110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010111001001010010
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes315 72 52
Gray code111111100101101111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010111001001010010
64-bit0000000000000000000000000000000000000000000101010111001001010010
One's complement11111111111010101000110110101101at 32 bits, every bit flipped
Bits reversed01001010010011101010100000000000at 32 bits
Rotated left by 100000000001010101110010010100100at 32 bits, wrapping
Shifted left by 11010101110010010100100= 2,811,044, no wrap
Shifted right by 110101011100100101001= 702,761, discarding the low bit
These bits as a double6.94420135 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,405,522 to the power 21,975,492,092,484
1,405,522 to the power 32,776,597,596,812,296,648
1,405,522 to the power 43,902,569,007,466,812,809,290,256
1,405,522 to the power 55,485,146,596,512,769,673,339,259,193,632
First ten multiples1,405,522, 2,811,044, 4,216,566, 5,622,088, 7,027,610, 8,433,132, 9,838,654, 11,244,176, 12,649,698, 14,055,220
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 8
Divisible by 12No, remainder 10
Divisible by 100No, remainder 22
Collatz (3n + 1) trajectory
Steps to reach 1106the total stopping time
Highest value reached8,004,9045× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,405,522 → 702,761 → 2,108,284 → 1,054,142 → 527,071 → 1,581,214 → 790,607 → 2,371,822 → 1,185,911 → 3,557,734 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage140,552,200%
1,405,522% as a decimal14,055.22
1,405,522% of 1001,405,522
1,405,522% of 1,00014,055,220
As a fraction of 1001,405,522/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,405,522
Nerdulate something else
Nothing in mind? Surprise me · today’s page