Recognised as Number
1,406,447
- Positive
- Odd
- Composite
- 7 digits
1,406,447 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,406,447
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7^2 × 28,703
Distinct prime factors27, 28,703
Number of divisors6
Sum of divisors σ(n)1,636,128
Aliquot sum229,681sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,205,484integers below n that share no factor with it
Carmichael function λ(n)602,742the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,205,484
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 7, 49, 28,703, 200,921, 1,406,4476 in total
Arithmetic
Previous number1,406,446
Next number1,406,448
Double2,812,894
Half703,223.5
Square1,978,093,163,809
Cube2,782,083,195,959,676,623
Square root1,185.937182148≈irrational, shown to 9 decimal places
Cube root112.040350045≈
Negation-1,406,447
Reciprocal7.11011506 × 10^-7≈
Representations
Decimal1,406,447
Binary10101011101011110111121 bits
Octal5272757
Hexadecimal1575EF
Base 36U57Z
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and six thousand, four hundred and forty-seven
Ordinalone million, four hundred and six thousand, four hundred and forty-seventh
Scientific notation1.406447 × 10^6
Engineering notation1.406447 × 10^6
In other bases
Ternary2122110021122base 3; the most digit-efficient integer base after e: 13 digits
Quinary330001242base 5; one hand: 9 digits
Septenary14645300base 7: 8 digits
Nonary2573248base 9; each digit is two ternary digits: 7 digits
Duodecimal579abbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8fg27base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:30:40:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T11010TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101000101000110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010111010111101111
Bit length21 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits6within that length
Bit parityodd15 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
Bytes315 75 ef
Gray code111111100111100011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010111010111101111
64-bit0000000000000000000000000000000000000000000101010111010111101111
One's complement11111111111010101000101000010000at 32 bits, every bit flipped
Bits reversed11110111101011101010100000000000at 32 bits
Rotated left by 100000000001010101110101111011110at 32 bits, wrapping
Shifted left by 11010101110101111011110= 2,812,894, no wrap
Shifted right by 110101011101011110111= 703,223, discarding the low bit
These bits as a double6.94877145 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,406,447 to the power 21,978,093,163,809
1,406,447 to the power 32,782,083,195,959,676,623
1,406,447 to the power 43,912,852,564,707,899,307,388,481
1,406,447 to the power 55,503,219,751,075,730,857,178,606,937,007
First ten multiples1,406,447, 2,812,894, 4,219,341, 5,625,788, 7,032,235, 8,438,682, 9,845,129, 11,251,576, 12,658,023, 14,064,470
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 11
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1199the total stopping time
Highest value reached24,030,48417× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,406,447 → 4,219,342 → 2,109,671 → 6,329,014 → 3,164,507 → 9,493,522 → 4,746,761 → 14,240,284 → 7,120,142 → 3,560,071 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage140,644,700%
1,406,447% as a decimal14,064.47
1,406,447% of 1001,406,447
1,406,447% of 1,00014,064,470
As a fraction of 1001,406,447/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,447
Nerdulate something else
Nothing in mind? Surprise me · today’s page