Nerdulator> put something in

Recognised as Number

1,132,069

  • Positive
  • Odd
  • Composite
  • 7 digits

1,132,069 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,132,069
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation421 × 2,689
Distinct prime factors2421, 2,689
Number of divisors4
Sum of divisors σ(n)1,135,180
Aliquot sum3,111sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,128,960integers below n that share no factor with it
Carmichael function λ(n)13,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,128,960
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 421, 2,689, 1,132,0694 in total

Arithmetic

Previous number1,132,068
Next number1,132,070
Double2,264,138
Cube1,450,837,238,936,684,509
Square root1,063.987311954≈irrational, shown to 9 decimal places
Cube root104.221575176≈
Negation-1,132,069
Reciprocal8.83338383 × 10^-7≈

Representations

Decimal1,132,069
Binary10001010001100010010121 bits
Octal4243045
Hexadecimal114625
Base 36O9ID
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and thirty-two thousand and sixty-nine
Ordinalone million, one hundred and thirty-two thousand and sixty-ninth
Scientific notation1.132069 × 10^6
Engineering notation1.132069 × 10^6

In other bases

Ternary2010111220111base 3; the most digit-efficient integer base after e: 13 digits
Quinary242211234base 5; one hand: 9 digits
Septenary12423331base 7: 8 digits
Nonary2114814base 9; each digit is two ternary digits: 7 digits
Duodecimal467171base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal71a39base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:14:27:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011TTT0T0111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010101101001100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100010100011000100101
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes311 46 25
Gray code110011110010100110111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100010100011000100101
64-bit0000000000000000000000000000000000000000000100010100011000100101
One's complement11111111111011101011100111011010at 32 bits, every bit flipped
Bits reversed10100100011000101000100000000000at 32 bits
Rotated left by 100000000001000101000110001001010at 32 bits, wrapping
Shifted left by 11000101000110001001010= 2,264,138, no wrap
Shifted right by 110001010001100010010= 566,034, discarding the low bit
These bits as a double5.59316402 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,132,091+22
Previous prime1,132,067−2
Distance to nearest prime2
Nearest square below1,129,969
Nearest square above1,132,096

Powers & multiples

1,132,069 to the power 21,281,580,220,761
1,132,069 to the power 31,450,837,238,936,684,509
1,132,069 to the power 41,642,447,862,245,813,495,419,121
1,132,069 to the power 51,859,364,308,964,755,837,945,628,891,349
First ten multiples1,132,069, 2,264,138, 3,396,207, 4,528,276, 5,660,345, 6,792,414, 7,924,483, 9,056,552, 10,188,621, 11,320,690
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 185the total stopping time
Highest value reached3,396,2083× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,132,069 → 3,396,208 → 1,698,104 → 849,052 → 424,526 → 212,263 → 636,790 → 318,395 → 955,186 → 477,593 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage113,206,900%
1,132,069% as a decimal11,320.69
1,132,069% of 1001,132,069
1,132,069% of 1,00011,320,690
As a fraction of 1001,132,069/100

Read another way

As bytes1.08 MiB
As a 24-bit colour#114625

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 “1132069” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.