Recognised as Number
1,506,870
- Positive
- Even
- Composite
- 7 digits
1,506,870 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,506,870
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 × 5 × 5,581
Distinct prime factors42, 3, 5, 5,581
Number of divisors32
Sum of divisors σ(n)4,019,040
Aliquot sum2,512,170sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)401,760integers below n that share no factor with it
Carmichael function λ(n)5,580the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 401,760
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 135, 270, 5,581, 11,162, 16,743, 27,905, 33,486, 50,229, 55,810, 83,715, 100,458, 150,687, 167,430, 251,145, 301,374, 502,290, 753,435, 1,506,87032 in total
Arithmetic
Previous number1,506,869
Next number1,506,871
Double3,013,740
Half753,435
Square2,270,657,196,900
Cube3,421,585,210,292,703,000
Square root1,227.546333138≈irrational, shown to 9 decimal places
Cube root114.64591784≈
Negation-1,506,870
Reciprocal6.63627254 × 10^-7≈
Representations
Decimal1,506,870
Binary10110111111100011011021 bits
Octal5577066
Hexadecimal16FE36
Base 36WAPI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and six thousand, eight hundred and seventy
Ordinalone million, five hundred and six thousand, eight hundred and seventieth
Scientific notation1.50687 × 10^6
Engineering notation1.50687 × 10^6
In other bases
Ternary2211120001000base 3; the most digit-efficient integer base after e: 13 digits
Quinary341204440base 5; one hand: 9 digits
Septenary15544131base 7: 8 digits
Nonary2746030base 9; each digit is two ternary digits: 7 digits
Duodecimal608046base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9873abase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:58:34:30base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100TTTT0001000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010110000001001001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101101111111000110110
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 set bits, so even; 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 fe 36
Gray code111011000000100101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101101111111000110110
64-bit0000000000000000000000000000000000000000000101101111111000110110
One's complement11111111111010010000000111001001at 32 bits, every bit flipped
Bits reversed01101100011111110110100000000000at 32 bits
Rotated left by 100000000001011011111110001101100at 32 bits, wrapping
Shifted left by 11011011111110001101100= 3,013,740, no wrap
Shifted right by 110110111111100011011= 753,435, discarding the low bit
These bits as a double7.444927 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,506,870 to the power 22,270,657,196,900
1,506,870 to the power 33,421,585,210,292,703,000
1,506,870 to the power 45,155,884,105,833,765,369,610,000
1,506,870 to the power 57,769,247,082,557,726,022,504,220,700,000
First ten multiples1,506,870, 3,013,740, 4,520,610, 6,027,480, 7,534,350, 9,041,220, 10,548,090, 12,054,960, 13,561,830, 15,068,700
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 1
Divisible by 8No, remainder 6
Divisible by 9Yes
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 6
Divisible by 100No, remainder 70
Collatz (3n + 1) trajectory
Steps to reach 1256the total stopping time
Highest value reached156,585,616103× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,506,870 → 753,435 → 2,260,306 → 1,130,153 → 3,390,460 → 1,695,230 → 847,615 → 2,542,846 → 1,271,423 → 3,814,270 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage150,687,000%
1,506,870% as a decimal15,068.7
1,506,870% of 1001,506,870
1,506,870% of 1,00015,068,700
As a fraction of 1001,506,870/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,870
Nerdulate something else
Nothing in mind? Surprise me · today’s page