Recognised as Number
1,311,472
- Positive
- Even
- Composite
- 7 digits
1,311,472 is an even 7-digit integer and a composite number. It has 10 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,311,472
Digit count7
Digit sum19
Digit product168
Multiplicative persistence4times 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 factorisation2^4 × 81,967
Distinct prime factors22, 81,967
Number of divisors10
Sum of divisors σ(n)2,541,008
Aliquot sum1,229,536sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)655,728integers below n that share no factor with it
Carmichael function λ(n)163,932the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 655,728
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 81,967, 163,934, 327,868, 655,736, 1,311,47210 in total
Arithmetic
Previous number1,311,471
Next number1,311,473
Double2,622,944
Half655,736
Square1,719,958,806,784
Cube2,255,677,816,250,626,048
Square root1,145.195179871≈irrational, shown to 9 decimal places
Cube root109.459385979≈
Negation-1,311,472
Reciprocal7.62501983 × 10^-7≈
Representations
Decimal1,311,472
Binary10100000000101111000021 bits
Octal5001360
Hexadecimal1402F0
Base 36S3XS
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and eleven thousand, four hundred and seventy-two
Ordinalone million, three hundred and eleven thousand, four hundred and seventy-second
Scientific notation1.311472 × 10^6
Engineering notation1.311472 × 10^6
In other bases
Ternary2110122000001base 3; the most digit-efficient integer base after e: 13 digits
Quinary313431342base 5; one hand: 9 digits
Septenary14101351base 7: 8 digits
Nonary2418001base 9; each digit is two ternary digits: 7 digits
Duodecimal532b54base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal83idcbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:4:17:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T111T0T000001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000000011100110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000000001011110000
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes314 02 f0
Gray code111100000001110001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000000001011110000
64-bit0000000000000000000000000000000000000000000101000000001011110000
One's complement11111111111010111111110100001111at 32 bits, every bit flipped
Bits reversed00001111010000000010100000000000at 32 bits
Rotated left by 100000000001010000000010111100000at 32 bits, wrapping
Shifted left by 11010000000010111100000= 2,622,944, no wrap
Shifted right by 110100000000101111000= 655,736, discarding the low bit
These bits as a double6.47953261 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,311,472 to the power 21,719,958,806,784
1,311,472 to the power 32,255,677,816,250,626,048
1,311,472 to the power 42,958,258,297,033,841,044,422,656
1,311,472 to the power 53,879,672,925,327,565,582,211,069,509,632
First ten multiples1,311,472, 2,622,944, 3,934,416, 5,245,888, 6,557,360, 7,868,832, 9,180,304, 10,491,776, 11,803,248, 13,114,720
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 8
Divisible by 12No, remainder 4
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached2,523,7961× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,311,472 → 655,736 → 327,868 → 163,934 → 81,967 → 245,902 → 122,951 → 368,854 → 184,427 → 553,282 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage131,147,200%
1,311,472% as a decimal13,114.72
1,311,472% of 1001,311,472
1,311,472% of 1,00013,114,720
As a fraction of 1001,311,472/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,311,472
Nerdulate something else
Nothing in mind? Surprise me · today’s page