Recognised as Number
1,045,398
- Positive
- Even
- Composite
- 7 digits
1,045,398 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,045,398
Digit count7
Digit sum30
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 17 × 37 × 277
Distinct prime factors52, 3, 17, 37, 277
Number of divisors32
Sum of divisors σ(n)2,281,824
Aliquot sum1,236,426sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)317,952integers below n that share no factor with it
Carmichael function λ(n)3,312the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 317,952
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 17, 34, 37, 51, 74, 102, 111, 222, 277, 554, 629, 831, 1,258, 1,662, 1,887, 3,774, 4,709, 9,418, 10,249, 14,127, 20,498, 28,254, 30,747, 61,494, 174,233, 348,466, 522,699, 1,045,39832 in total
Arithmetic
Previous number1,045,397
Next number1,045,399
Double2,090,796
Half522,699
Square1,092,856,978,404
Cube1,142,470,499,509,584,792
Square root1,022.447064644≈irrational, shown to 9 decimal places
Cube root101.490927546≈
Negation-1,045,398
Reciprocal9.56573477 × 10^-7≈
Representations
Decimal1,045,398
Binary1111111100111001011020 bits
Octal3771626
HexadecimalFF396
Base 36MEMU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, forty-five thousand, three hundred and ninety-eight
Ordinalone million, forty-five thousand, three hundred and ninety-eighth
Scientific notation1.045398 × 10^6
Engineering notation1.045398 × 10^6
In other bases
Ternary1222010000110base 3; the most digit-efficient integer base after e: 13 digits
Quinary231423043base 5; one hand: 9 digits
Septenary11612544base 7: 8 digits
Nonary1863013base 9; each digit is two ternary digits: 7 digits
Duodecimal424b86base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6ad9ibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:50:23:18base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T010000110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000011010011101010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011111111001110010110
Bit length20 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits6within that length
Bit parityeven14 set bits, so even; not the same as the number itself being even
Highest set bitbit 19worth 524,288
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes30f f3 96
Gray code10000000101001011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011111111001110010110
64-bit0000000000000000000000000000000000000000000011111111001110010110
One's complement11111111111100000000110001101001at 32 bits, every bit flipped
Bits reversed01101001110011111111000000000000at 32 bits
Rotated left by 100000000000111111110011100101100at 32 bits, wrapping
Shifted left by 1111111110011100101100= 2,090,796, no wrap
Shifted right by 11111111100111001011= 522,699, discarding the low bit
These bits as a double5.16495238 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,045,398 to the power 21,092,856,978,404
1,045,398 to the power 31,142,470,499,509,584,792
1,045,398 to the power 41,194,336,375,246,320,922,387,216
1,045,398 to the power 51,248,556,858,009,753,399,621,750,831,968
First ten multiples1,045,398, 2,090,796, 3,136,194, 4,181,592, 5,226,990, 6,272,388, 7,317,786, 8,363,184, 9,408,582, 10,453,980
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 8
Divisible by 11No, remainder 2
Divisible by 12No, remainder 6
Divisible by 100No, remainder 98
Collatz (3n + 1) trajectory
Steps to reach 1165the total stopping time
Highest value reached2,352,1482× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,045,398 → 522,699 → 1,568,098 → 784,049 → 2,352,148 → 1,176,074 → 588,037 → 1,764,112 → 882,056 → 441,028 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage104,539,800%
1,045,398% as a decimal10,453.98
1,045,398% of 1001,045,398
1,045,398% of 1,00010,453,980
As a fraction of 1001,045,398/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,045,398
Nerdulate something else
Nothing in mind? Surprise me · today’s page