Recognised as Number
3,838,183
- Positive
- Odd
- Prime
- 7 digits
3,838,183 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,838,183
Digit count7
Digit sum34
Digit product13,824
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,838,183
Distinct prime factors13,838,183
Number of divisors2
Sum of divisors σ(n)3,838,184
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,838,182integers below n that share no factor with it
Carmichael function λ(n)3,838,182the 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,838,1832 in total
Arithmetic
Previous number3,838,182
Next number3,838,184
Double7,676,366
Half1,919,091.5
Square14,731,648,741,489
Cube56,542,763,761,554,474,487
Square root1,959.128122405≈irrational, shown to 9 decimal places
Cube root156.570002741≈
Negation-3,838,183
Reciprocal2.60539948 × 10^-7≈
Representations
Decimal3,838,183
Binary111010100100001110011122 bits
Octal16510347
Hexadecimal3A90E7
Base 362A9K7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, eight hundred and thirty-eight thousand, one hundred and eighty-three
Ordinalthree million, eight hundred and thirty-eight thousand, one hundred and eighty-third
Scientific notation3.838183 × 10^6
Engineering notation3.838183 × 10^6
In other bases
Ternary21012222222221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1440310213base 5; one hand: 10 digits
Septenary44424016base 7: 8 digits
Nonary7188887base 9; each digit is two ternary digits: 7 digits
Duodecimal1351207base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal13jf93base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:46:9:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11T00000000T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011111001000100111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110101001000011100111
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; 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 90 e7
Gray code1001111101100010010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110101001000011100111
64-bit0000000000000000000000000000000000000000001110101001000011100111
One's complement11111111110001010110111100011000at 32 bits, every bit flipped
Bits reversed11100111000010010101110000000000at 32 bits
Rotated left by 100000000011101010010000111001110at 32 bits, wrapping
Shifted left by 111101010010000111001110= 7,676,366, no wrap
Shifted right by 1111010100100001110011= 1,919,091, discarding the low bit
These bits as a double1.89631436 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,838,183 to the power 214,731,648,741,489
3,838,183 to the power 356,542,763,761,554,474,487
3,838,183 to the power 4217,021,474,642,614,437,549,937,121
3,838,183 to the power 5832,968,134,608,213,809,758,730,308,891,143
First ten multiples3,838,183, 7,676,366, 11,514,549, 15,352,732, 19,190,915, 23,029,098, 26,867,281, 30,705,464, 34,543,647, 38,381,830
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 83
Collatz (3n + 1) trajectory
Steps to reach 1278the total stopping time
Highest value reached46,686,61612× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,838,183 → 11,514,550 → 5,757,275 → 17,271,826 → 8,635,913 → 25,907,740 → 12,953,870 → 6,476,935 → 19,430,806 → 9,715,403 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage383,818,300%
3,838,183% as a decimal38,381.83
3,838,183% of 1003,838,183
3,838,183% of 1,00038,381,830
As a fraction of 1003,838,183/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,838,183
Nerdulate something else
Nothing in mind? Surprise me · today’s page