Recognised as Number
1,151,264
- Positive
- Even
- Composite
- 7 digits
1,151,264 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,151,264
Digit count7
Digit sum20
Digit product240
Multiplicative persistence2times 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 numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^5 × 35,977
Distinct prime factors22, 35,977
Number of divisors12
Sum of divisors σ(n)2,266,614
Aliquot sum1,115,350sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)575,616integers below n that share no factor with it
Carmichael function λ(n)35,976the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 575,616
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 35,977, 71,954, 143,908, 287,816, 575,632, 1,151,26412 in total
Arithmetic
Previous number1,151,263
Next number1,151,265
Double2,302,528
Half575,632
Square1,325,408,797,696
Cube1,525,895,434,070,687,744
Square root1,072.969710663≈irrational, shown to 9 decimal places
Cube root104.807326178≈
Negation-1,151,264
Reciprocal8.68610501 × 10^-7≈
Representations
Decimal1,151,264
Binary10001100100010010000021 bits
Octal4310440
Hexadecimal119120
Base 36OOBK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and fifty-one thousand, two hundred and sixty-four
Ordinalone million, one hundred and fifty-one thousand, two hundred and sixty-fourth
Scientific notation1.151264 × 10^6
Engineering notation1.151264 × 10^6
In other bases
Ternary2011111020102base 3; the most digit-efficient integer base after e: 13 digits
Quinary243320024base 5; one hand: 9 digits
Septenary12533312base 7: 8 digits
Nonary2144212base 9; each digit is two ternary digits: 7 digits
Duodecimal4762a8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal73i34base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:19:47:44base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0111111T011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101001000101100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100011001000100100000
Bit length21 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits15within that length
Bit parityeven6 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 91 20
Gray code110010101100110110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100011001000100100000
64-bit0000000000000000000000000000000000000000000100011001000100100000
One's complement11111111111011100110111011011111at 32 bits, every bit flipped
Bits reversed00000100100010011000100000000000at 32 bits
Rotated left by 100000000001000110010001001000000at 32 bits, wrapping
Shifted left by 11000110010001001000000= 2,302,528, no wrap
Shifted right by 110001100100010010000= 575,632, discarding the low bit
These bits as a double5.68799992 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,151,264 to the power 21,325,408,797,696
1,151,264 to the power 31,525,895,434,070,687,744
1,151,264 to the power 41,756,708,481,009,956,254,908,416
1,151,264 to the power 52,022,435,232,681,446,277,850,882,637,824
First ten multiples1,151,264, 2,302,528, 3,453,792, 4,605,056, 5,756,320, 6,907,584, 8,058,848, 9,210,112, 10,361,376, 11,512,640
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 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10No, remainder 4
Divisible by 11No, remainder 4
Divisible by 12No, remainder 8
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 198the total stopping time
Highest value reached1,151,264
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,151,264 → 575,632 → 287,816 → 143,908 → 71,954 → 35,977 → 107,932 → 53,966 → 26,983 → 80,950 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage115,126,400%
1,151,264% as a decimal11,512.64
1,151,264% of 1001,151,264
1,151,264% of 1,00011,512,640
As a fraction of 1001,151,264/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,151,264
Nerdulate something else
Nothing in mind? Surprise me · today’s page