Recognised as Number
1,446,511
- Positive
- Odd
- Composite
- 7 digits
1,446,511 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,446,511
Digit count7
Digit sum22
Digit product480
Multiplicative persistence2times 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 factorisation11 × 131,501
Distinct prime factors211, 131,501
Number of divisors4
Sum of divisors σ(n)1,578,024
Aliquot sum131,513sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,315,000integers below n that share no factor with it
Carmichael function λ(n)131,500the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,315,000
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 131,501, 1,446,5114 in total
Arithmetic
Previous number1,446,510
Next number1,446,512
Double2,893,022
Half723,255.5
Square2,092,394,073,121
Cube3,026,671,043,104,330,831
Square root1,202.709856948≈irrational, shown to 9 decimal places
Cube root113.094264413≈
Negation-1,446,511
Reciprocal6.91318628 × 10^-7≈
Representations
Decimal1,446,511
Binary10110000100100110111121 bits
Octal5411157
Hexadecimal16126F
Base 36V04V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and forty-six thousand, five hundred and eleven
Ordinalone million, four hundred and forty-six thousand, five hundred and eleventh
Scientific notation1.446511 × 10^6
Engineering notation1.446511 × 10^6
In other bases
Ternary2201111020111base 3; the most digit-efficient integer base after e: 13 digits
Quinary332242021base 5; one hand: 9 digits
Septenary15203143base 7: 8 digits
Nonary2644214base 9; each digit is two ternary digits: 7 digits
Duodecimal599127base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal90g5bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:41:48:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T011111T0111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010100001011110110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100001001001101111
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
Bytes316 12 6f
Gray code111010001101101011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100001001001101111
64-bit0000000000000000000000000000000000000000000101100001001001101111
One's complement11111111111010011110110110010000at 32 bits, every bit flipped
Bits reversed11110110010010000110100000000000at 32 bits
Rotated left by 100000000001011000010010011011110at 32 bits, wrapping
Shifted left by 11011000010010011011110= 2,893,022, no wrap
Shifted right by 110110000100100110111= 723,255, discarding the low bit
These bits as a double7.14671391 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,446,511 to the power 22,092,394,073,121
1,446,511 to the power 33,026,671,043,104,330,831
1,446,511 to the power 44,378,112,957,231,888,694,680,641
1,446,511 to the power 56,332,988,551,878,456,547,631,188,693,551
First ten multiples1,446,511, 2,893,022, 4,339,533, 5,786,044, 7,232,555, 8,679,066, 10,125,577, 11,572,088, 13,018,599, 14,465,110
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 7
Divisible by 100No, remainder 11
Collatz (3n + 1) trajectory
Steps to reach 1274the total stopping time
Highest value reached17,594,98012× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,446,511 → 4,339,534 → 2,169,767 → 6,509,302 → 3,254,651 → 9,763,954 → 4,881,977 → 14,645,932 → 7,322,966 → 3,661,483 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage144,651,100%
1,446,511% as a decimal14,465.11
1,446,511% of 1001,446,511
1,446,511% of 1,00014,465,110
As a fraction of 1001,446,511/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,446,511
Nerdulate something else
Nothing in mind? Surprise me · today’s page