Recognised as Number
1,480,609
- Positive
- Odd
- Composite
- 7 digits
1,480,609 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,480,609
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation13^2 × 8,761
Distinct prime factors213, 8,761
Number of divisors6
Sum of divisors σ(n)1,603,446
Aliquot sum122,837sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,366,560integers below n that share no factor with it
Carmichael function λ(n)113,880the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,366,560
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 13, 169, 8,761, 113,893, 1,480,6096 in total
Arithmetic
Previous number1,480,608
Next number1,480,610
Double2,961,218
Half740,304.5
Square2,192,203,010,881
Cube3,245,795,507,737,506,529
Square root1,216.802777775≈irrational, shown to 9 decimal places
Cube root113.976013215≈
Negation-1,480,609
Reciprocal6.75397759 × 10^-7≈
Representations
Decimal1,480,609
Binary10110100101111010000121 bits
Octal5513641
Hexadecimal1697A1
Base 36VQG1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and eighty thousand, six hundred and nine
Ordinalone million, four hundred and eighty thousand, six hundred and ninth
Scientific notation1.480609 × 10^6
Engineering notation1.480609 × 10^6
In other bases
Ternary2210020000101base 3; the most digit-efficient integer base after e: 13 digits
Quinary334334414base 5; one hand: 9 digits
Septenary15404434base 7: 8 digits
Nonary2706011base 9; each digit is two ternary digits: 7 digits
Duodecimal5b4a01base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal951a9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:51:16:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T101T0000101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111110100011100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101101001011110100001
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes316 97 a1
Gray code111011101110001110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101101001011110100001
64-bit0000000000000000000000000000000000000000000101101001011110100001
One's complement11111111111010010110100001011110at 32 bits, every bit flipped
Bits reversed10000101111010010110100000000000at 32 bits
Rotated left by 100000000001011010010111101000010at 32 bits, wrapping
Shifted left by 11011010010111101000010= 2,961,218, no wrap
Shifted right by 110110100101111010000= 740,304, discarding the low bit
These bits as a double7.31518042 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,480,609 to the power 22,192,203,010,881
1,480,609 to the power 33,245,795,507,737,506,529
1,480,609 to the power 44,805,754,040,915,721,804,396,161
1,480,609 to the power 57,115,442,684,766,185,945,085,195,542,049
First ten multiples1,480,609, 2,961,218, 4,441,827, 5,922,436, 7,403,045, 8,883,654, 10,364,263, 11,844,872, 13,325,481, 14,806,090
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 175the total stopping time
Highest value reached4,441,8283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,480,609 → 4,441,828 → 2,220,914 → 1,110,457 → 3,331,372 → 1,665,686 → 832,843 → 2,498,530 → 1,249,265 → 3,747,796 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage148,060,900%
1,480,609% as a decimal14,806.09
1,480,609% of 1001,480,609
1,480,609% of 1,00014,806,090
As a fraction of 1001,480,609/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,480,609
Nerdulate something else
Nothing in mind? Surprise me · today’s page