Recognised as Number
1,648,749
- Positive
- Odd
- Composite
- 7 digits
1,648,749 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,648,749
Digit count7
Digit sum39
Digit product48,384
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 43 × 12,781
Distinct prime factors33, 43, 12,781
Number of divisors8
Sum of divisors σ(n)2,249,632
Aliquot sum600,883sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,073,520integers below n that share no factor with it
Carmichael function λ(n)89,460the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,073,520
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 43, 129, 12,781, 38,343, 549,583, 1,648,7498 in total
Arithmetic
Previous number1,648,748
Next number1,648,750
Double3,297,498
Half824,374.5
Square2,718,373,265,001
Cube4,481,915,202,297,133,749
Square root1,284.036214443≈irrational, shown to 9 decimal places
Cube root118.13670358≈
Negation-1,648,749
Reciprocal6.06520459 × 10^-7≈
Representations
Decimal1,648,749
Binary11001001010000110110121 bits
Octal6224155
Hexadecimal19286D
Base 36ZC6L
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and forty-eight thousand, seven hundred and forty-nine
Ordinalone million, six hundred and forty-eight thousand, seven hundred and forty-ninth
Scientific notation1.648749 × 10^6
Engineering notation1.648749 × 10^6
In other bases
Ternary10002202122210base 3; the most digit-efficient integer base after e: 14 digits
Quinary410224444base 5; one hand: 9 digits
Septenary20004564base 7: 8 digits
Nonary3082583base 9; each digit is two ternary digits: 7 digits
Duodecimal676179base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala61h9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:37:59:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10010T10T00T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010010111100110111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110010010100001101101
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; 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
Bytes319 28 6d
Gray code101011011110001011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110010010100001101101
64-bit0000000000000000000000000000000000000000000110010010100001101101
One's complement11111111111001101101011110010010at 32 bits, every bit flipped
Bits reversed10110110000101001001100000000000at 32 bits
Rotated left by 100000000001100100101000011011010at 32 bits, wrapping
Shifted left by 11100100101000011011010= 3,297,498, no wrap
Shifted right by 111001001010000110110= 824,374, discarding the low bit
These bits as a double8.1459024 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,648,749 to the power 22,718,373,265,001
1,648,749 to the power 34,481,915,202,297,133,749
1,648,749 to the power 47,389,553,207,872,196,971,530,001
1,648,749 to the power 512,183,518,461,926,076,884,613,117,618,749
First ten multiples1,648,749, 3,297,498, 4,946,247, 6,594,996, 8,243,745, 9,892,494, 11,541,243, 13,189,992, 14,838,741, 16,487,490
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1207the total stopping time
Highest value reached7,042,6244× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,648,749 → 4,946,248 → 2,473,124 → 1,236,562 → 618,281 → 1,854,844 → 927,422 → 463,711 → 1,391,134 → 695,567 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage164,874,900%
1,648,749% as a decimal16,487.49
1,648,749% of 1001,648,749
1,648,749% of 1,00016,487,490
As a fraction of 1001,648,749/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,648,749
Nerdulate something else
Nothing in mind? Surprise me · today’s page