Recognised as Number
1,443,115
- Positive
- Odd
- Composite
- 7 digits
1,443,115 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,443,115
Digit count7
Digit sum19
Digit product240
Multiplicative persistence2times 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 factorisation5 × 349 × 827
Distinct prime factors35, 349, 827
Number of divisors8
Sum of divisors σ(n)1,738,800
Aliquot sum295,685sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,149,792integers below n that share no factor with it
Carmichael function λ(n)143,724the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,149,792
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 349, 827, 1,745, 4,135, 288,623, 1,443,1158 in total
Arithmetic
Previous number1,443,114
Next number1,443,116
Double2,886,230
Half721,557.5
Square2,082,580,903,225
Cube3,005,403,740,157,545,875
Square root1,201.297215513≈irrational, shown to 9 decimal places
Cube root113.005690579≈
Negation-1,443,115
Reciprocal6.92945469 × 10^-7≈
Representations
Decimal1,443,115
Binary10110000001010010101121 bits
Octal5402453
Hexadecimal16052B
Base 36UXIJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and forty-three thousand, one hundred and fifteen
Ordinalone million, four hundred and forty-three thousand, one hundred and fifteenth
Scientific notation1.443115 × 10^6
Engineering notation1.443115 × 10^6
In other bases
Ternary2201022120201base 3; the most digit-efficient integer base after e: 13 digits
Quinary332134430base 5; one hand: 9 digits
Septenary15160222base 7: 8 digits
Nonary2638521base 9; each digit is two ternary digits: 7 digits
Duodecimal597177base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal907ffbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:40:51:55base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T01100TT1T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010100000010101111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100000010100101011
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 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 05 2b
Gray code111010000011110111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100000010100101011
64-bit0000000000000000000000000000000000000000000101100000010100101011
One's complement11111111111010011111101011010100at 32 bits, every bit flipped
Bits reversed11010100101000000110100000000000at 32 bits
Rotated left by 100000000001011000000101001010110at 32 bits, wrapping
Shifted left by 11011000000101001010110= 2,886,230, no wrap
Shifted right by 110110000001010010101= 721,557, discarding the low bit
These bits as a double7.12993544 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,443,115 to the power 22,082,580,903,225
1,443,115 to the power 33,005,403,740,157,545,875
1,443,115 to the power 44,337,143,218,477,456,815,400,625
1,443,115 to the power 56,258,996,435,733,095,092,156,872,946,875
First ten multiples1,443,115, 2,886,230, 4,329,345, 5,772,460, 7,215,575, 8,658,690, 10,101,805, 11,544,920, 12,988,035, 14,431,150
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 15
Collatz (3n + 1) trajectory
Steps to reach 1212the total stopping time
Highest value reached6,494,0204× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,443,115 → 4,329,346 → 2,164,673 → 6,494,020 → 3,247,010 → 1,623,505 → 4,870,516 → 2,435,258 → 1,217,629 → 3,652,888 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage144,311,500%
1,443,115% as a decimal14,431.15
1,443,115% of 1001,443,115
1,443,115% of 1,00014,431,150
As a fraction of 1001,443,115/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,443,115
Nerdulate something else
Nothing in mind? Surprise me · today’s page