Recognised as Number
1,443,353
- Positive
- Odd
- Prime
- 7 digits
1,443,353 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,443,353
Digit count7
Digit sum23
Digit product2,160
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,443,353
Distinct prime factors11,443,353
Number of divisors2
Sum of divisors σ(n)1,443,354
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,443,352integers below n that share no factor with it
Carmichael function λ(n)1,443,352the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,443,3532 in total
Arithmetic
Previous number1,443,352
Next number1,443,354
Double2,886,706
Half721,676.5
Square2,083,267,882,609
Cube3,006,890,948,167,347,977
Square root1,201.396271011≈irrational, shown to 9 decimal places
Cube root113.011902576≈
Negation-1,443,353
Reciprocal6.92831206 × 10^-7≈
Representations
Decimal1,443,353
Binary10110000001100001100121 bits
Octal5403031
Hexadecimal160619
Base 36UXP5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and forty-three thousand, three hundred and fifty-three
Ordinalone million, four hundred and forty-three thousand, three hundred and fifty-third
Scientific notation1.443353 × 10^6
Engineering notation1.443353 × 10^6
In other bases
Ternary2201022220112base 3; the most digit-efficient integer base after e: 13 digits
Quinary332141403base 5; one hand: 9 digits
Septenary15161012base 7: 8 digits
Nonary2638815base 9; each digit is two ternary digits: 7 digits
Duodecimal597335base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9087dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:40:55:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T011000T1TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010100001101001101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100000011000011001
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; 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 06 19
Gray code111010000010100010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100000011000011001
64-bit0000000000000000000000000000000000000000000101100000011000011001
One's complement11111111111010011111100111100110at 32 bits, every bit flipped
Bits reversed10011000011000000110100000000000at 32 bits
Rotated left by 100000000001011000000110000110010at 32 bits, wrapping
Shifted left by 11011000000110000110010= 2,886,706, no wrap
Shifted right by 110110000001100001100= 721,676, discarding the low bit
These bits as a double7.13111132 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,443,353 to the power 22,083,267,882,609
1,443,353 to the power 33,006,890,948,167,347,977
1,443,353 to the power 44,340,005,070,710,186,204,646,881
1,443,353 to the power 56,264,159,338,824,759,389,035,689,631,993
First ten multiples1,443,353, 2,886,706, 4,330,059, 5,773,412, 7,216,765, 8,660,118, 10,103,471, 11,546,824, 12,990,177, 14,433,530
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 53
Collatz (3n + 1) trajectory
Steps to reach 1212the total stopping time
Highest value reached4,871,3203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,443,353 → 4,330,060 → 2,165,030 → 1,082,515 → 3,247,546 → 1,623,773 → 4,871,320 → 2,435,660 → 1,217,830 → 608,915 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage144,335,300%
1,443,353% as a decimal14,433.53
1,443,353% of 1001,443,353
1,443,353% of 1,00014,433,530
As a fraction of 1001,443,353/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,353
Nerdulate something else
Nothing in mind? Surprise me · today’s page