Recognised as Number
1,331,534
- Positive
- Even
- Composite
- 7 digits
1,331,534 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,331,534
Digit count7
Digit sum20
Digit product540
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 71 × 9,377
Distinct prime factors32, 71, 9,377
Number of divisors8
Sum of divisors σ(n)2,025,648
Aliquot sum694,114sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)656,320integers below n that share no factor with it
Carmichael function λ(n)328,160the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 656,320
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 71, 142, 9,377, 18,754, 665,767, 1,331,5348 in total
Arithmetic
Previous number1,331,533
Next number1,331,535
Double2,663,068
Half665,767
Square1,772,982,793,156
Cube2,360,786,870,502,181,304
Square root1,153.921141153≈irrational, shown to 9 decimal places
Cube root110.014708777≈
Negation-1,331,534
Reciprocal7.51013493 × 10^-7≈
Representations
Decimal1,331,534
Binary10100010100010100111021 bits
Octal5050516
Hexadecimal14514E
Base 36SJF2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and thirty-one thousand, five hundred and thirty-four
Ordinalone million, three hundred and thirty-one thousand, five hundred and thirty-fourth
Scientific notation1.331534 × 10^6
Engineering notation1.331534 × 10^6
In other bases
Ternary2111122112002base 3; the most digit-efficient integer base after e: 13 digits
Quinary320102114base 5; one hand: 9 digits
Septenary14214011base 7: 8 digits
Nonary2448462base 9; each digit is two ternary digits: 7 digits
Duodecimal542692base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal868gebase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:9:52:14base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTT00TTT01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000101000101010010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101000101000101001110
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 11 trailing zero
Power of twoNo
Bytes314 51 4e
Gray code111100111100111101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101000101000101001110
64-bit0000000000000000000000000000000000000000000101000101000101001110
One's complement11111111111010111010111010110001at 32 bits, every bit flipped
Bits reversed01110010100010100010100000000000at 32 bits
Rotated left by 100000000001010001010001010011100at 32 bits, wrapping
Shifted left by 11010001010001010011100= 2,663,068, no wrap
Shifted right by 110100010100010100111= 665,767, discarding the low bit
These bits as a double6.57865206 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,331,534 to the power 21,772,982,793,156
1,331,534 to the power 32,360,786,870,502,181,304
1,331,534 to the power 43,143,467,984,827,251,480,440,336
1,331,534 to the power 54,185,634,499,708,969,472,756,642,355,424
First ten multiples1,331,534, 2,663,068, 3,994,602, 5,326,136, 6,657,670, 7,989,204, 9,320,738, 10,652,272, 11,983,806, 13,315,340
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 4No, remainder 2
Divisible by 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7No, remainder 1
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 4
Divisible by 11No, remainder 6
Divisible by 12No, remainder 2
Divisible by 100No, remainder 34
Collatz (3n + 1) trajectory
Steps to reach 1230the total stopping time
Highest value reached12,797,1889× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,331,534 → 665,767 → 1,997,302 → 998,651 → 2,995,954 → 1,497,977 → 4,493,932 → 2,246,966 → 1,123,483 → 3,370,450 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage133,153,400%
1,331,534% as a decimal13,315.34
1,331,534% of 1001,331,534
1,331,534% of 1,00013,315,340
As a fraction of 1001,331,534/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,331,534
Nerdulate something else
Nothing in mind? Surprise me · today’s page