Recognised as Number
1,129,509
- Positive
- Odd
- Composite
- 7 digits
1,129,509 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,129,509
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 41 × 3,061
Distinct prime factors33, 41, 3,061
Number of divisors12
Sum of divisors σ(n)1,671,852
Aliquot sum542,343sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)734,400integers below n that share no factor with it
Carmichael function λ(n)6,120the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 734,400
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 41, 123, 369, 3,061, 9,183, 27,549, 125,501, 376,503, 1,129,50912 in total
Arithmetic
Previous number1,129,508
Next number1,129,510
Double2,259,018
Half564,754.5
Square1,275,790,581,081
Cube1,441,016,943,446,219,229
Square root1,062.783609207≈irrational, shown to 9 decimal places
Cube root104.142955528≈
Negation-1,129,509
Reciprocal8.85340444 × 10^-7≈
Representations
Decimal1,129,509
Binary10001001111000010010121 bits
Octal4236045
Hexadecimal113C25
Base 36O7J9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty-nine thousand, five hundred and nine
Ordinalone million, one hundred and twenty-nine thousand, five hundred and ninth
Scientific notation1.129509 × 10^6
Engineering notation1.129509 × 10^6
In other bases
Ternary2010101101200base 3; the most digit-efficient integer base after e: 13 digits
Quinary242121014base 5; one hand: 9 digits
Septenary12413013base 7: 8 digits
Nonary2111350base 9; each digit is two ternary digits: 7 digits
Duodecimal465799base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal713f9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:13:45:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01010111TT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010100110001100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010011110000100101
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; 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 3c 25
Gray code110011010001000110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010011110000100101
64-bit0000000000000000000000000000000000000000000100010011110000100101
One's complement11111111111011101100001111011010at 32 bits, every bit flipped
Bits reversed10100100001111001000100000000000at 32 bits
Rotated left by 100000000001000100111100001001010at 32 bits, wrapping
Shifted left by 11000100111100001001010= 2,259,018, no wrap
Shifted right by 110001001111000010010= 564,754, discarding the low bit
These bits as a double5.58051594 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,129,509 to the power 21,275,790,581,081
1,129,509 to the power 31,441,016,943,446,219,229
1,129,509 to the power 41,627,641,606,774,995,635,128,561
1,129,509 to the power 51,838,435,843,626,818,544,838,425,806,549
First ten multiples1,129,509, 2,259,018, 3,388,527, 4,518,036, 5,647,545, 6,777,054, 7,906,563, 9,036,072, 10,165,581, 11,295,090
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1160the total stopping time
Highest value reached3,388,5283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,129,509 → 3,388,528 → 1,694,264 → 847,132 → 423,566 → 211,783 → 635,350 → 317,675 → 953,026 → 476,513 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,950,900%
1,129,509% as a decimal11,295.09
1,129,509% of 1001,129,509
1,129,509% of 1,00011,295,090
As a fraction of 1001,129,509/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,129,509
Nerdulate something else
Nothing in mind? Surprise me · today’s page