Nerdulator> put something in

Recognised as Number

1,160,480

  • Positive
  • Even
  • Composite
  • 7 digits

1,160,480 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,160,480
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^5 × 5 × 7,253
Distinct prime factors32, 5, 7,253
Number of divisors24
Sum of divisors σ(n)2,742,012
Aliquot sum1,581,532sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)464,128integers below n that share no factor with it
Carmichael function λ(n)14,504the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 464,128
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 80, 160, 7,253, 14,506, 29,012, 36,265, 58,024, 72,530, 116,048, 145,060, 232,096, 290,120, 580,240, 1,160,48024 in total

Arithmetic

Previous number1,160,479
Next number1,160,481
Double2,320,960
Cube1,562,834,465,902,592,000
Square root1,077.255772786≈irrational, shown to 9 decimal places
Cube root105.086248108≈
Negation-1,160,480
Reciprocal8.61712395 × 10^-7≈

Representations

Decimal1,160,480
Binary10001101101010010000021 bits
Octal4332440
Hexadecimal11B520
Base 36OVFK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and sixty thousand, four hundred and eighty
Ordinalone million, one hundred and sixty thousand, four hundred and eightieth
Scientific notation1.16048 × 10^6
Engineering notation1.16048 × 10^6

In other bases

Ternary2011221212202base 3; the most digit-efficient integer base after e: 13 digits
Quinary244113410base 5; one hand: 9 digits
Septenary12602216base 7: 8 digits
Nonary2157782base 9; each digit is two ternary digits: 7 digits
Duodecimal47b6a8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal75140base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:22:21:20base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT00T0T0T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101111010101100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100011011010100100000
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 55 trailing zeros
Power of twoNo
Bytes311 b5 20
Gray code110010110111110110000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100011011010100100000
64-bit0000000000000000000000000000000000000000000100011011010100100000
One's complement11111111111011100100101011011111at 32 bits, every bit flipped
Bits reversed00000100101011011000100000000000at 32 bits
Rotated left by 100000000001000110110101001000000at 32 bits, wrapping
Shifted left by 11000110110101001000000= 2,320,960, no wrap
Shifted right by 110001101101010010000= 580,240, discarding the low bit
These bits as a double5.73353301 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,160,491+11
Previous prime1,160,479−1
Distance to nearest prime1
Nearest square below1,159,929
Nearest square above1,162,084

Powers & multiples

1,160,480 to the power 21,346,713,830,400
1,160,480 to the power 31,562,834,465,902,592,000
1,160,480 to the power 41,813,638,140,990,639,964,160,000
1,160,480 to the power 52,104,690,789,856,817,865,608,396,800,000
First ten multiples1,160,480, 2,320,960, 3,481,440, 4,641,920, 5,802,400, 6,962,880, 8,123,360, 9,283,840, 10,444,320, 11,604,800
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 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 8
Divisible by 100No, remainder 80

Collatz (3n + 1) trajectory

Steps to reach 1129the total stopping time
Highest value reached1,160,480
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,160,480 → 580,240 → 290,120 → 145,060 → 72,530 → 36,265 → 108,796 → 54,398 → 27,199 → 81,598 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage116,048,000%
1,160,480% as a decimal11,604.8
1,160,480% of 1001,160,480
1,160,480% of 1,00011,604,800
As a fraction of 1001,160,480/100

Read another way

As bytes1.107 MiB
As a 24-bit colour#11B520

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “1160480” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.