Recognised as Number
1,332,458
- Positive
- Even
- Composite
- 7 digits
1,332,458 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,332,458
Digit count7
Digit sum26
Digit product2,880
Multiplicative persistence2times 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 factorisation2 × 666,229
Distinct prime factors22, 666,229
Number of divisors4
Sum of divisors σ(n)1,998,690
Aliquot sum666,232sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)666,228integers below n that share no factor with it
Carmichael function λ(n)666,228the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 666,229, 1,332,4584 in total
Arithmetic
Previous number1,332,457
Next number1,332,459
Double2,664,916
Half666,229
Square1,775,444,321,764
Cube2,365,704,990,089,015,912
Square root1,154.321445699≈irrational, shown to 9 decimal places
Cube root110.040150632≈
Negation-1,332,458
Reciprocal7.50492698 × 10^-7≈
Representations
Decimal1,332,458
Binary10100010101001110101021 bits
Octal5052352
Hexadecimal1454EA
Base 36SK4Q
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and thirty-two thousand, four hundred and fifty-eight
Ordinalone million, three hundred and thirty-two thousand, four hundred and fifty-eighth
Scientific notation1.332458 × 10^6
Engineering notation1.332458 × 10^6
In other bases
Ternary2111200210022base 3; the most digit-efficient integer base after e: 13 digits
Quinary320114313base 5; one hand: 9 digits
Septenary14216501base 7: 8 digits
Nonary2450708base 9; each digit is two ternary digits: 7 digits
Duodecimal543122base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal86b2ibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:10:7:38base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTT01T1010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000101010100111110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000101010011101010
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes314 54 ea
Gray code111100111111010011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000101010011101010
64-bit0000000000000000000000000000000000000000000101000101010011101010
One's complement11111111111010111010101100010101at 32 bits, every bit flipped
Bits reversed01010111001010100010100000000000at 32 bits
Rotated left by 100000000001010001010100111010100at 32 bits, wrapping
Shifted left by 11010001010100111010100= 2,664,916, no wrap
Shifted right by 110100010101001110101= 666,229, discarding the low bit
These bits as a double6.58321722 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,332,458 to the power 21,775,444,321,764
1,332,458 to the power 32,365,704,990,089,015,912
1,332,458 to the power 43,152,202,539,684,029,964,071,696
1,332,458 to the power 54,200,177,491,622,303,197,867,043,908,768
First ten multiples1,332,458, 2,664,916, 3,997,374, 5,329,832, 6,662,290, 7,994,748, 9,327,206, 10,659,664, 11,992,122, 13,324,580
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 8
Divisible by 10No, remainder 8
Divisible by 11No, remainder 6
Divisible by 12No, remainder 2
Divisible by 100No, remainder 58
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached1,998,6881× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,332,458 → 666,229 → 1,998,688 → 999,344 → 499,672 → 249,836 → 124,918 → 62,459 → 187,378 → 93,689 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage133,245,800%
1,332,458% as a decimal13,324.58
1,332,458% of 1001,332,458
1,332,458% of 1,00013,324,580
As a fraction of 1001,332,458/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,332,458
Nerdulate something else
Nothing in mind? Surprise me · today’s page