Recognised as Number
3,814,681
- Positive
- Odd
- Composite
- 7 digits
3,814,681 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,814,681
Digit count7
Digit sum31
Digit product4,608
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 factorisation13 × 17 × 41 × 421
Distinct prime factors413, 17, 41, 421
Number of divisors16
Sum of divisors σ(n)4,466,448
Aliquot sum651,767sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,225,600integers below n that share no factor with it
Carmichael function λ(n)1,680the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,225,600
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 17, 41, 221, 421, 533, 697, 5,473, 7,157, 9,061, 17,261, 93,041, 224,393, 293,437, 3,814,68116 in total
Arithmetic
Previous number3,814,680
Next number3,814,682
Double7,629,362
Half1,907,340.5
Square14,551,791,131,761
Cube55,510,441,146,297,183,241
Square root1,953.120835996≈irrational, shown to 9 decimal places
Cube root156.24977792≈
Negation-3,814,681
Reciprocal2.62145118 × 10^-7≈
Representations
Decimal3,814,681
Binary111010001101010001100122 bits
Octal16432431
Hexadecimal3A3519
Base 3629RFD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, eight hundred and fourteen thousand, six hundred and eighty-one
Ordinalthree million, eight hundred and fourteen thousand, six hundred and eighty-first
Scientific notation3.814681 × 10^6
Engineering notation3.814681 × 10^6
In other bases
Ternary21011210202111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1434032211base 5; one hand: 10 digits
Septenary44265343base 7: 8 digits
Nonary7153674base 9; each digit is two ternary digits: 7 digits
Duodecimal133b6a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal13gge1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:39:38:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11TTT11T1T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011100111010101101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110100011010100011001
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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 19
Gray code1001110010111110010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110100011010100011001
64-bit0000000000000000000000000000000000000000001110100011010100011001
One's complement11111111110001011100101011100110at 32 bits, every bit flipped
Bits reversed10011000101011000101110000000000at 32 bits
Rotated left by 100000000011101000110101000110010at 32 bits, wrapping
Shifted left by 111101000110101000110010= 7,629,362, no wrap
Shifted right by 1111010001101010001100= 1,907,340, discarding the low bit
These bits as a double1.88470283 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,814,681 to the power 214,551,791,131,761
3,814,681 to the power 355,510,441,146,297,183,241
3,814,681 to the power 4211,754,625,142,398,085,262,961,121
3,814,681 to the power 5807,776,345,192,828,270,288,997,792,017,401
First ten multiples3,814,681, 7,629,362, 11,444,043, 15,258,724, 19,073,405, 22,888,086, 26,702,767, 30,517,448, 34,332,129, 38,146,810
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 1154the total stopping time
Highest value reached27,496,7447× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,814,681 → 11,444,044 → 5,722,022 → 2,861,011 → 8,583,034 → 4,291,517 → 12,874,552 → 6,437,276 → 3,218,638 → 1,609,319 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage381,468,100%
3,814,681% as a decimal38,146.81
3,814,681% of 1003,814,681
3,814,681% of 1,00038,146,810
As a fraction of 1003,814,681/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,681
Nerdulate something else
Nothing in mind? Surprise me · today’s page