Recognised as Number
1,152,091
- Positive
- Odd
- Prime
- 7 digits
1,152,091 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,152,091
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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,152,091
Distinct prime factors11,152,091
Number of divisors2
Sum of divisors σ(n)1,152,092
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,152,090integers below n that share no factor with it
Carmichael function λ(n)1,152,090the 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,152,0912 in total
Arithmetic
Previous number1,152,090
Next number1,152,092
Double2,304,182
Half576,045.5
Square1,327,313,672,281
Cube1,529,186,136,011,889,571
Square root1,073.355020485≈irrational, shown to 9 decimal places
Cube root104.832415967≈
Negation-1,152,091
Reciprocal8.67986991 × 10^-7≈
Representations
Decimal1,152,091
Binary10001100101000101101121 bits
Octal4312133
Hexadecimal11945B
Base 36OOYJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and fifty-two thousand and ninety-one
Ordinalone million, one hundred and fifty-two thousand and ninety-first
Scientific notation1.152091 × 10^6
Engineering notation1.152091 × 10^6
In other bases
Ternary2011112101001base 3; the most digit-efficient integer base after e: 13 digits
Quinary243331331base 5; one hand: 9 digits
Septenary12535603base 7: 8 digits
Nonary2145331base 9; each digit is two ternary digits: 7 digits
Duodecimal476877base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7404bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:20:1:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TTTTT101001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101001010110101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100011001010001011011
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 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 94 5b
Gray code110010101111001110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100011001010001011011
64-bit0000000000000000000000000000000000000000000100011001010001011011
One's complement11111111111011100110101110100100at 32 bits, every bit flipped
Bits reversed11011010001010011000100000000000at 32 bits
Rotated left by 100000000001000110010100010110110at 32 bits, wrapping
Shifted left by 11000110010100010110110= 2,304,182, no wrap
Shifted right by 110001100101000101101= 576,045, discarding the low bit
These bits as a double5.69208584 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,152,091 to the power 21,327,313,672,281
1,152,091 to the power 31,529,186,136,011,889,571
1,152,091 to the power 41,761,761,584,624,073,867,742,961
1,152,091 to the power 52,029,709,665,791,133,886,361,855,681,451
First ten multiples1,152,091, 2,304,182, 3,456,273, 4,608,364, 5,760,455, 6,912,546, 8,064,637, 9,216,728, 10,368,819, 11,520,910
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 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1222the total stopping time
Highest value reached16,835,52414× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,152,091 → 3,456,274 → 1,728,137 → 5,184,412 → 2,592,206 → 1,296,103 → 3,888,310 → 1,944,155 → 5,832,466 → 2,916,233 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage115,209,100%
1,152,091% as a decimal11,520.91
1,152,091% of 1001,152,091
1,152,091% of 1,00011,520,910
As a fraction of 1001,152,091/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,152,091
Nerdulate something else
Nothing in mind? Surprise me · today’s page