Recognised as Number
1,061,448
- Positive
- Even
- Composite
- 7 digits
1,061,448 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,061,448
Digit count7
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 3 × 47 × 941
Distinct prime factors42, 3, 47, 941
Number of divisors32
Sum of divisors σ(n)2,712,960
Aliquot sum1,651,512sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)345,920integers below n that share no factor with it
Carmichael function λ(n)21,620the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 345,920
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 12, 24, 47, 94, 141, 188, 282, 376, 564, 941, 1,128, 1,882, 2,823, 3,764, 5,646, 7,528, 11,292, 22,584, 44,227, 88,454, 132,681, 176,908, 265,362, 353,816, 530,724, 1,061,44832 in total
Arithmetic
Previous number1,061,447
Next number1,061,449
Double2,122,896
Half530,724
Square1,126,671,856,704
Cube1,195,903,588,954,747,392
Square root1,030.265985074≈irrational, shown to 9 decimal places
Cube root102.007688771≈
Negation-1,061,448
Reciprocal9.4210927 × 10^-7≈
Representations
Decimal1,061,448
Binary10000001100100100100021 bits
Octal4031110
Hexadecimal103248
Base 36MR0O
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, sixty-one thousand, four hundred and forty-eight
Ordinalone million, sixty-one thousand, four hundred and forty-eighth
Scientific notation1.061448 × 10^6
Engineering notation1.061448 × 10^6
In other bases
Ternary1222221000220base 3; the most digit-efficient integer base after e: 13 digits
Quinary232431243base 5; one hand: 9 digits
Septenary12010413base 7: 8 digits
Nonary1887026base 9; each digit is two ternary digits: 7 digits
Duodecimal432320base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6cdc8base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:54:50:48base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0000T10010T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000111011001011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000011001001001000
Bit length21 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits15within that length
Bit parityeven6 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes310 32 48
Gray code110000010101101101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000011001001001000
64-bit0000000000000000000000000000000000000000000100000011001001001000
One's complement11111111111011111100110110110111at 32 bits, every bit flipped
Bits reversed00010010010011000000100000000000at 32 bits
Rotated left by 100000000001000000110010010010000at 32 bits, wrapping
Shifted left by 11000000110010010010000= 2,122,896, no wrap
Shifted right by 110000001100100100100= 530,724, discarding the low bit
These bits as a double5.24424992 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,061,448 to the power 21,126,671,856,704
1,061,448 to the power 31,195,903,588,954,747,392
1,061,448 to the power 41,269,389,472,688,838,709,743,616
1,061,448 to the power 51,347,390,917,006,622,470,779,941,715,968
First ten multiples1,061,448, 2,122,896, 3,184,344, 4,245,792, 5,307,240, 6,368,688, 7,430,136, 8,491,584, 9,553,032, 10,614,480
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7No, remainder 3
Divisible by 8Yes
Divisible by 9No, remainder 6
Divisible by 10No, remainder 8
Divisible by 11No, remainder 3
Divisible by 12Yes
Divisible by 100No, remainder 48
Collatz (3n + 1) trajectory
Steps to reach 1209the total stopping time
Highest value reached6,127,9725× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,061,448 → 530,724 → 265,362 → 132,681 → 398,044 → 199,022 → 99,511 → 298,534 → 149,267 → 447,802 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage106,144,800%
1,061,448% as a decimal10,614.48
1,061,448% of 1001,061,448
1,061,448% of 1,00010,614,480
As a fraction of 1001,061,448/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,061,448
Nerdulate something else
Nothing in mind? Surprise me · today’s page