Recognised as Number
3,814,717
- Positive
- Odd
- Prime
- 7 digits
3,814,717 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,814,717
Digit count7
Digit sum31
Digit product4,704
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,814,717
Distinct prime factors13,814,717
Number of divisors2
Sum of divisors σ(n)3,814,718
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,814,716integers below n that share no factor with it
Carmichael function λ(n)3,814,716the 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, 3,814,7172 in total
Arithmetic
Previous number3,814,716
Next number3,814,718
Double7,629,434
Half1,907,358.5
Square14,552,065,790,089
Cube55,512,012,754,570,939,813
Square root1,953.130051993≈irrational, shown to 9 decimal places
Cube root156.25026944≈
Negation-3,814,717
Reciprocal2.62142644 × 10^-7≈
Representations
Decimal3,814,717
Binary111010001101010011110122 bits
Octal16432475
Hexadecimal3A353D
Base 3629RGD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, eight hundred and fourteen thousand, seven hundred and seventeen
Ordinalthree million, eight hundred and fourteen thousand, seven hundred and seventeenth
Scientific notation3.814717 × 10^6
Engineering notation3.814717 × 10^6
In other bases
Ternary21011210210211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1434032332base 5; one hand: 10 digits
Septenary44265424base 7: 8 digits
Nonary7153724base 9; each digit is two ternary digits: 7 digits
Duodecimal133b711base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal13ggfhbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:39:38:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11TTT11T11T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011100111010101001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110100011010100111101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes33a 35 3d
Gray code1001110010111110100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110100011010100111101
64-bit0000000000000000000000000000000000000000001110100011010100111101
One's complement11111111110001011100101011000010at 32 bits, every bit flipped
Bits reversed10111100101011000101110000000000at 32 bits
Rotated left by 100000000011101000110101001111010at 32 bits, wrapping
Shifted left by 111101000110101001111010= 7,629,434, no wrap
Shifted right by 1111010001101010011110= 1,907,358, discarding the low bit
These bits as a double1.88472062 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,814,717 to the power 214,552,065,790,089
3,814,717 to the power 355,512,012,754,570,939,813
3,814,717 to the power 4211,762,618,759,078,591,810,627,921
3,814,717 to the power 5807,814,461,744,776,008,516,063,110,913,357
First ten multiples3,814,717, 7,629,434, 11,444,151, 15,258,868, 19,073,585, 22,888,302, 26,703,019, 30,517,736, 34,332,453, 38,147,170
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1172the total stopping time
Highest value reached11,444,1523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,814,717 → 11,444,152 → 5,722,076 → 2,861,038 → 1,430,519 → 4,291,558 → 2,145,779 → 6,437,338 → 3,218,669 → 9,656,008 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage381,471,700%
3,814,717% as a decimal38,147.17
3,814,717% of 1003,814,717
3,814,717% of 1,00038,147,170
As a fraction of 1003,814,717/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 3,814,717
Nerdulate something else
Nothing in mind? Surprise me · today’s page