Recognised as Number
1,164,511
- Positive
- Odd
- Prime
- 7 digits
1,164,511 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,164,511
Digit count7
Digit sum19
Digit product120
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,164,511
Distinct prime factors11,164,511
Number of divisors2
Sum of divisors σ(n)1,164,512
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,164,510integers below n that share no factor with it
Carmichael function λ(n)1,164,510the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,164,5112 in total
Arithmetic
Previous number1,164,510
Next number1,164,512
Double2,329,022
Half582,255.5
Square1,356,085,869,121
Cube1,579,176,911,535,964,831
Square root1,079.125108595≈irrational, shown to 9 decimal places
Cube root105.207782053≈
Negation-1,164,511
Reciprocal8.58729544 × 10^-7≈
Representations
Decimal1,164,511
Binary10001110001001101111121 bits
Octal4342337
Hexadecimal11C4DF
Base 36OYJJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and sixty-four thousand, five hundred and eleven
Ordinalone million, one hundred and sixty-four thousand, five hundred and eleventh
Scientific notation1.164511 × 10^6
Engineering notation1.164511 × 10^6
In other bases
Ternary2012011102001base 3; the most digit-efficient integer base after e: 13 digits
Quinary244231021base 5; one hand: 9 digits
Septenary12620035base 7: 8 digits
Nonary2164361base 9; each digit is two ternary digits: 7 digits
Duodecimal481aa7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal75b5bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:23:28:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT01111T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101100010100100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100011100010011011111
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 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 c4 df
Gray code110010010011010110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100011100010011011111
64-bit0000000000000000000000000000000000000000000100011100010011011111
One's complement11111111111011100011101100100000at 32 bits, every bit flipped
Bits reversed11111011001000111000100000000000at 32 bits
Rotated left by 100000000001000111000100110111110at 32 bits, wrapping
Shifted left by 11000111000100110111110= 2,329,022, no wrap
Shifted right by 110001110001001101111= 582,255, discarding the low bit
These bits as a double5.75344879 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,164,511 to the power 21,356,085,869,121
1,164,511 to the power 31,579,176,911,535,964,831
1,164,511 to the power 41,838,968,884,429,657,941,312,641
1,164,511 to the power 52,141,499,494,576,065,398,895,924,883,551
First ten multiples1,164,511, 2,329,022, 3,493,533, 4,658,044, 5,822,555, 6,987,066, 8,151,577, 9,316,088, 10,480,599, 11,645,110
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 11
Collatz (3n + 1) trajectory
Steps to reach 1191the total stopping time
Highest value reached116,432,29699× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,164,511 → 3,493,534 → 1,746,767 → 5,240,302 → 2,620,151 → 7,860,454 → 3,930,227 → 11,790,682 → 5,895,341 → 17,686,024 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage116,451,100%
1,164,511% as a decimal11,645.11
1,164,511% of 1001,164,511
1,164,511% of 1,00011,645,110
As a fraction of 1001,164,511/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,164,511
Nerdulate something else
Nothing in mind? Surprise me · today’s page