Recognised as Number
1,105,152
- Positive
- Even
- Composite
- 7 digits
1,105,152 is an even 7-digit integer and a composite number. It has 36 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,105,152
Digit count7
Digit sum15
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 numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^8 × 3 × 1,439
Distinct prime factors32, 3, 1,439
Number of divisors36
Sum of divisors σ(n)2,943,360
Aliquot sum1,838,208sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)368,128integers below n that share no factor with it
Carmichael function λ(n)46,016the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 368,128
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 192, 256, 384, 768, 1,439, 2,878, 4,317, 5,756, 8,634, 11,512, 17,268, 23,024, 34,536, 46,048, 69,072, 92,096, 138,144, 184,192, 276,288, 368,384, 552,576, 1,105,15236 in total
Arithmetic
Previous number1,105,151
Next number1,105,153
Double2,210,304
Half552,576
Square1,221,360,943,104
Cube1,349,789,488,993,271,808
Square root1,051.262098622≈irrational, shown to 9 decimal places
Cube root103.388921415≈
Negation-1,105,152
Reciprocal9.04852907 × 10^-7≈
Representations
Decimal1,105,152
Binary10000110111010000000021 bits
Octal4156400
Hexadecimal10DD00
Base 36NOQO
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and five thousand, one hundred and fifty-two
Ordinalone million, one hundred and five thousand, one hundred and fifty-second
Scientific notation1.105152 × 10^6
Engineering notation1.105152 × 10^6
In other bases
Ternary2002010222120base 3; the most digit-efficient integer base after e: 13 digits
Quinary240331102base 5; one hand: 9 digits
Septenary12252006base 7: 8 digits
Nonary2063876base 9; each digit is two ternary digits: 7 digits
Duodecimal453680base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6i2hcbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:6:59:12base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T011000TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010010110100000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001101110100000000
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 88 trailing zeros
Power of twoNo
Bytes310 dd 00
Gray code110001011001110000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001101110100000000
64-bit0000000000000000000000000000000000000000000100001101110100000000
One's complement11111111111011110010001011111111at 32 bits, every bit flipped
Bits reversed00000000101110110000100000000000at 32 bits
Rotated left by 100000000001000011011101000000000at 32 bits, wrapping
Shifted left by 11000011011101000000000= 2,210,304, no wrap
Shifted right by 110000110111010000000= 552,576, discarding the low bit
These bits as a double5.46017637 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,105,152 to the power 21,221,360,943,104
1,105,152 to the power 31,349,789,488,993,271,808
1,105,152 to the power 41,491,722,553,339,892,325,154,816
1,105,152 to the power 51,648,580,163,268,688,682,929,495,212,032
First ten multiples1,105,152, 2,210,304, 3,315,456, 4,420,608, 5,525,760, 6,630,912, 7,736,064, 8,841,216, 9,946,368, 11,051,520
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 2
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 4
Divisible by 12Yes
Divisible by 100No, remainder 52
Collatz (3n + 1) trajectory
Steps to reach 159the total stopping time
Highest value reached1,105,152
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,105,152 → 552,576 → 276,288 → 138,144 → 69,072 → 34,536 → 17,268 → 8,634 → 4,317 → 12,952 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage110,515,200%
1,105,152% as a decimal11,051.52
1,105,152% of 1001,105,152
1,105,152% of 1,00011,051,520
As a fraction of 1001,105,152/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,105,152
Nerdulate something else
Nothing in mind? Surprise me · today’s page