Recognised as Number
1,506,734
- Positive
- Even
- Composite
- 7 digits
1,506,734 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,506,734
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 753,367
Distinct prime factors22, 753,367
Number of divisors4
Sum of divisors σ(n)2,260,104
Aliquot sum753,370sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)753,366integers below n that share no factor with it
Carmichael function λ(n)753,366the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 753,367, 1,506,7344 in total
Arithmetic
Previous number1,506,733
Next number1,506,735
Double3,013,468
Half753,367
Square2,270,247,346,756
Cube3,420,658,865,767,054,904
Square root1,227.49093683≈irrational, shown to 9 decimal places
Cube root114.642468679≈
Negation-1,506,734
Reciprocal6.63687154 × 10^-7≈
Representations
Decimal1,506,734
Binary10110111111011010111021 bits
Octal5576656
Hexadecimal16FDAE
Base 36WALQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and six thousand, seven hundred and thirty-four
Ordinalone million, five hundred and six thousand, seven hundred and thirty-fourth
Scientific notation1.506734 × 10^6
Engineering notation1.506734 × 10^6
In other bases
Ternary2211112211222base 3; the most digit-efficient integer base after e: 13 digits
Quinary341203414base 5; one hand: 9 digits
Septenary15543545base 7: 8 digits
Nonary2745758base 9; each digit is two ternary digits: 7 digits
Duodecimal607b52base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal986gebase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:58:32:14base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100TTTT00TT00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010110000001011110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101101111110110101110
Bit length21 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits6within that length
Bit parityodd15 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
Bytes316 fd ae
Gray code111011000001101111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101101111110110101110
64-bit0000000000000000000000000000000000000000000101101111110110101110
One's complement11111111111010010000001001010001at 32 bits, every bit flipped
Bits reversed01110101101111110110100000000000at 32 bits
Rotated left by 100000000001011011111101101011100at 32 bits, wrapping
Shifted left by 11011011111101101011100= 3,013,468, no wrap
Shifted right by 110110111111011010111= 753,367, discarding the low bit
These bits as a double7.44425507 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,506,734 to the power 22,270,247,346,756
1,506,734 to the power 33,420,658,865,767,054,904
1,506,734 to the power 45,154,023,015,452,657,703,723,536
1,506,734 to the power 57,765,741,714,165,044,752,562,178,291,424
First ten multiples1,506,734, 3,013,468, 4,520,202, 6,026,936, 7,533,670, 9,040,404, 10,547,138, 12,053,872, 13,560,606, 15,067,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 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 8
Divisible by 10No, remainder 4
Divisible by 11No, remainder 9
Divisible by 12No, remainder 2
Divisible by 100No, remainder 34
Collatz (3n + 1) trajectory
Steps to reach 1150the total stopping time
Highest value reached5,085,2323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,506,734 → 753,367 → 2,260,102 → 1,130,051 → 3,390,154 → 1,695,077 → 5,085,232 → 2,542,616 → 1,271,308 → 635,654 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage150,673,400%
1,506,734% as a decimal15,067.34
1,506,734% of 1001,506,734
1,506,734% of 1,00015,067,340
As a fraction of 1001,506,734/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,506,734
Nerdulate something else
Nothing in mind? Surprise me · today’s page