Recognised as Number
1,328,403
- Positive
- Odd
- Composite
- 7 digits
1,328,403 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,328,403
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 29 × 15,269
Distinct prime factors33, 29, 15,269
Number of divisors8
Sum of divisors σ(n)1,832,400
Aliquot sum503,997sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)855,008integers below n that share no factor with it
Carmichael function λ(n)106,876the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 855,008
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 29, 87, 15,269, 45,807, 442,801, 1,328,4038 in total
Arithmetic
Previous number1,328,402
Next number1,328,404
Double2,656,806
Half664,201.5
Square1,764,654,530,409
Cube2,344,172,372,158,906,827
Square root1,152.563664185≈irrational, shown to 9 decimal places
Cube root109.928410719≈
Negation-1,328,403
Reciprocal7.52783606 × 10^-7≈
Representations
Decimal1,328,403
Binary10100010001010001001121 bits
Octal5042423
Hexadecimal144513
Base 36SH03
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and twenty-eight thousand, four hundred and three
Ordinalone million, three hundred and twenty-eight thousand, four hundred and third
Scientific notation1.328403 × 10^6
Engineering notation1.328403 × 10^6
In other bases
Ternary2111111020010base 3; the most digit-efficient integer base after e: 13 digits
Quinary320002103base 5; one hand: 9 digits
Septenary14201616base 7: 8 digits
Nonary2444203base 9; each digit is two ternary digits: 7 digits
Duodecimal540903base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal86103base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:9:0:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1111111T0010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000100010100010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000100010100010011
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
Bytes314 45 13
Gray code111100110011110011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000100010100010011
64-bit0000000000000000000000000000000000000000000101000100010100010011
One's complement11111111111010111011101011101100at 32 bits, every bit flipped
Bits reversed11001000101000100010100000000000at 32 bits
Rotated left by 100000000001010001000101000100110at 32 bits, wrapping
Shifted left by 11010001000101000100110= 2,656,806, no wrap
Shifted right by 110100010001010001001= 664,201, discarding the low bit
These bits as a double6.56318286 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,328,403 to the power 21,764,654,530,409
1,328,403 to the power 32,344,172,372,158,906,827
1,328,403 to the power 43,114,005,611,693,008,305,707,281
1,328,403 to the power 54,136,654,396,589,827,312,326,469,202,243
First ten multiples1,328,403, 2,656,806, 3,985,209, 5,313,612, 6,642,015, 7,970,418, 9,298,821, 10,627,224, 11,955,627, 13,284,030
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 3
Collatz (3n + 1) trajectory
Steps to reach 1292the total stopping time
Highest value reached67,316,56050× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,328,403 → 3,985,210 → 1,992,605 → 5,977,816 → 2,988,908 → 1,494,454 → 747,227 → 2,241,682 → 1,120,841 → 3,362,524 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage132,840,300%
1,328,403% as a decimal13,284.03
1,328,403% of 1001,328,403
1,328,403% of 1,00013,284,030
As a fraction of 1001,328,403/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,328,403
Nerdulate something else
Nothing in mind? Surprise me · today’s page