Recognised as Number
1,267,272
- Positive
- Even
- Composite
- 7 digits
1,267,272 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,267,272
Digit count7
Digit sum27
Digit product2,352
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 3^3 × 5,867
Distinct prime factors32, 3, 5,867
Number of divisors32
Sum of divisors σ(n)3,520,800
Aliquot sum2,253,528sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)422,352integers below n that share no factor with it
Carmichael function λ(n)52,794the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 422,352
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 108, 216, 5,867, 11,734, 17,601, 23,468, 35,202, 46,936, 52,803, 70,404, 105,606, 140,808, 158,409, 211,212, 316,818, 422,424, 633,636, 1,267,27232 in total
Arithmetic
Previous number1,267,271
Next number1,267,273
Double2,534,544
Half633,636
Square1,605,978,321,984
Cube2,035,211,360,057,307,648
Square root1,125.731762011≈irrational, shown to 9 decimal places
Cube root108.21561862≈
Negation-1,267,272
Reciprocal7.89096579 × 10^-7≈
Representations
Decimal1,267,272
Binary10011010101100100100021 bits
Octal4653110
Hexadecimal135648
Base 36R5U0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and sixty-seven thousand, two hundred and seventy-two
Ordinalone million, two hundred and sixty-seven thousand, two hundred and seventy-second
Scientific notation1.267272 × 10^6
Engineering notation1.267272 × 10^6
In other bases
Ternary2101101101000base 3; the most digit-efficient integer base after e: 13 digits
Quinary311023042base 5; one hand: 9 digits
Septenary13525446base 7: 8 digits
Nonary2341330base 9; each digit is two ternary digits: 7 digits
Duodecimal511460base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7i83cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:52:1:12base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T101101101000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101001010101001011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100110101011001001000
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes313 56 48
Gray code110101111110101101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100110101011001001000
64-bit0000000000000000000000000000000000000000000100110101011001001000
One's complement11111111111011001010100110110111at 32 bits, every bit flipped
Bits reversed00010010011010101100100000000000at 32 bits
Rotated left by 100000000001001101010110010010000at 32 bits, wrapping
Shifted left by 11001101010110010010000= 2,534,544, no wrap
Shifted right by 110011010101100100100= 633,636, discarding the low bit
These bits as a double6.26115559 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,267,272 to the power 21,605,978,321,984
1,267,272 to the power 32,035,211,360,057,307,648
1,267,272 to the power 42,579,166,370,682,544,377,696,256
1,267,272 to the power 53,268,505,324,907,609,378,611,889,733,632
First ten multiples1,267,272, 2,534,544, 3,801,816, 5,069,088, 6,336,360, 7,603,632, 8,870,904, 10,138,176, 11,405,448, 12,672,720
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12Yes
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 1103the total stopping time
Highest value reached1,267,272
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,267,272 → 633,636 → 316,818 → 158,409 → 475,228 → 237,614 → 118,807 → 356,422 → 178,211 → 534,634 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage126,727,200%
1,267,272% as a decimal12,672.72
1,267,272% of 1001,267,272
1,267,272% of 1,00012,672,720
As a fraction of 1001,267,272/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,267,272
Nerdulate something else
Nothing in mind? Surprise me · today’s page