Recognised as Number
1,406,446
- Positive
- Even
- Composite
- 7 digits
1,406,446 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,406,446
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 703,223
Distinct prime factors22, 703,223
Number of divisors4
Sum of divisors σ(n)2,109,672
Aliquot sum703,226sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)703,222integers below n that share no factor with it
Carmichael function λ(n)703,222the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 703,223, 1,406,4464 in total
Arithmetic
Previous number1,406,445
Next number1,406,447
Double2,812,892
Half703,223
Square1,978,090,350,916
Cube2,782,077,261,684,404,536
Square root1,185.93676054≈irrational, shown to 9 decimal places
Cube root112.040323491≈
Negation-1,406,446
Reciprocal7.11012012 × 10^-7≈
Representations
Decimal1,406,446
Binary10101011101011110111021 bits
Octal5272756
Hexadecimal1575EE
Base 36U57Y
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and six thousand, four hundred and forty-six
Ordinalone million, four hundred and six thousand, four hundred and forty-sixth
Scientific notation1.406446 × 10^6
Engineering notation1.406446 × 10^6
In other bases
Ternary2122110021121base 3; the most digit-efficient integer base after e: 13 digits
Quinary330001241base 5; one hand: 9 digits
Septenary14645266base 7: 8 digits
Nonary2573247base 9; each digit is two ternary digits: 7 digits
Duodecimal579ababase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8fg26base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:30:40:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T11010TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101000101000110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010111010111101110
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes315 75 ee
Gray code111111100111100011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010111010111101110
64-bit0000000000000000000000000000000000000000000101010111010111101110
One's complement11111111111010101000101000010001at 32 bits, every bit flipped
Bits reversed01110111101011101010100000000000at 32 bits
Rotated left by 100000000001010101110101111011100at 32 bits, wrapping
Shifted left by 11010101110101111011100= 2,812,892, no wrap
Shifted right by 110101011101011110111= 703,223, discarding the low bit
These bits as a double6.94876651 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,406,446 to the power 21,978,090,350,916
1,406,446 to the power 32,782,077,261,684,404,536
1,406,446 to the power 43,912,841,436,386,984,022,039,056
1,406,446 to the power 55,503,200,186,840,728,129,860,742,154,976
First ten multiples1,406,446, 2,812,892, 4,219,338, 5,625,784, 7,032,230, 8,438,676, 9,845,122, 11,251,568, 12,658,014, 14,064,460
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 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 7
Divisible by 10No, remainder 6
Divisible by 11No, remainder 8
Divisible by 12No, remainder 10
Divisible by 100No, remainder 46
Collatz (3n + 1) trajectory
Steps to reach 1199the total stopping time
Highest value reached4,746,7603× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,406,446 → 703,223 → 2,109,670 → 1,054,835 → 3,164,506 → 1,582,253 → 4,746,760 → 2,373,380 → 1,186,690 → 593,345 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage140,644,600%
1,406,446% as a decimal14,064.46
1,406,446% of 1001,406,446
1,406,446% of 1,00014,064,460
As a fraction of 1001,406,446/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,406,446
Nerdulate something else
Nothing in mind? Surprise me · today’s page