Recognised as Number
1,714,049
- Positive
- Odd
- Prime
- 7 digits
1,714,049 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,714,049
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 factorisation1,714,049
Distinct prime factors11,714,049
Number of divisors2
Sum of divisors σ(n)1,714,050
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,714,048integers below n that share no factor with it
Carmichael function λ(n)1,714,048the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,714,0492 in total
Arithmetic
Previous number1,714,048
Next number1,714,050
Double3,428,098
Half857,024.5
Square2,937,963,974,401
Cube5,035,814,212,358,059,649
Square root1,309.216941534≈irrational, shown to 9 decimal places
Cube root119.676187182≈
Negation-1,714,049
Reciprocal5.83413893 × 10^-7≈
Representations
Decimal1,714,049
Binary11010001001111000000121 bits
Octal6423601
Hexadecimal1A2781
Base 3610QKH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seven hundred and fourteen thousand and forty-nine
Ordinalone million, seven hundred and fourteen thousand and forty-ninth
Scientific notation1.714049 × 10^6
Engineering notation1.714049 × 10^6
In other bases
Ternary10020002020022base 3; the most digit-efficient integer base after e: 14 digits
Quinary414322144base 5; one hand: 9 digits
Septenary20366141base 7: 8 digits
Nonary3202208base 9; each digit is two ternary digits: 7 digits
Duodecimal6a7b15base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalae529base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:56:7:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101T001T1T010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100111100010000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110100010011110000001
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes31a 27 81
Gray code101110011010001000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110100010011110000001
64-bit0000000000000000000000000000000000000000000110100010011110000001
One's complement11111111111001011101100001111110at 32 bits, every bit flipped
Bits reversed10000001111001000101100000000000at 32 bits
Rotated left by 100000000001101000100111100000010at 32 bits, wrapping
Shifted left by 11101000100111100000010= 3,428,098, no wrap
Shifted right by 111010001001111000000= 857,024, discarding the low bit
These bits as a double8.46852726 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,714,049 to the power 22,937,963,974,401
1,714,049 to the power 35,035,814,212,358,059,649
1,714,049 to the power 48,631,632,314,878,119,783,308,801
1,714,049 to the power 514,795,040,737,684,526,336,460,667,045,249
First ten multiples1,714,049, 3,428,098, 5,142,147, 6,856,196, 8,570,245, 10,284,294, 11,998,343, 13,712,392, 15,426,441, 17,140,490
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1127the total stopping time
Highest value reached5,142,1483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,714,049 → 5,142,148 → 2,571,074 → 1,285,537 → 3,856,612 → 1,928,306 → 964,153 → 2,892,460 → 1,446,230 → 723,115 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage171,404,900%
1,714,049% as a decimal17,140.49
1,714,049% of 1001,714,049
1,714,049% of 1,00017,140,490
As a fraction of 1001,714,049/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,714,049
Nerdulate something else
Nothing in mind? Surprise me · today’s page