Recognised as Number
4,213,081
- Positive
- Odd
- Prime
- 7 digits
4,213,081 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,213,081
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,213,081
Distinct prime factors14,213,081
Number of divisors2
Sum of divisors σ(n)4,213,082
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,213,080integers below n that share no factor with it
Carmichael function λ(n)4,213,080the 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, 4,213,0812 in total
Arithmetic
Previous number4,213,080
Next number4,213,082
Double8,426,162
Half2,106,540.5
Square17,750,051,512,561
Cube74,782,404,776,592,010,441
Square root2,052.579109316≈irrational, shown to 9 decimal places
Cube root161.510193071≈
Negation-4,213,081
Reciprocal2.37355987 × 10^-7≈
Representations
Decimal4,213,081
Binary1000000010010010101100123 bits
Octal20044531
Hexadecimal404959
Base 362IAU1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, two hundred and thirteen thousand and eighty-one
Ordinalfour million, two hundred and thirteen thousand and eighty-first
Scientific notation4.213081 × 10^6
Engineering notation4.213081 × 10^6
In other bases
Ternary21221001021001base 3; the most digit-efficient integer base after e: 14 digits
Quinary2034304311base 5; one hand: 10 digits
Septenary50545015base 7: 8 digits
Nonary7831231base 9; each digit is two ternary digits: 7 digits
Duodecimal14b2161base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal166ce1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:30:18:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T10011T1001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000000101111010101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000000100100101011001
Bit length23 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits15within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes340 49 59
Gray code11000000110110111110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000000100100101011001
64-bit0000000000000000000000000000000000000000010000000100100101011001
One's complement11111111101111111011011010100110at 32 bits, every bit flipped
Bits reversed10011010100100100000001000000000at 32 bits
Rotated left by 100000000100000001001001010110010at 32 bits, wrapping
Shifted left by 1100000001001001010110010= 8,426,162, no wrap
Shifted right by 11000000010010010101100= 2,106,540, discarding the low bit
These bits as a double2.08153859 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,213,081 to the power 217,750,051,512,561
4,213,081 to the power 374,782,404,776,592,010,441
4,213,081 to the power 4315,064,328,698,569,043,940,778,721
4,213,081 to the power 51,327,391,537,017,695,966,215,059,954,649,401
First ten multiples4,213,081, 8,426,162, 12,639,243, 16,852,324, 21,065,405, 25,278,486, 29,491,567, 33,704,648, 37,917,729, 42,130,810
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
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 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 1167the total stopping time
Highest value reached14,219,1523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,213,081 → 12,639,244 → 6,319,622 → 3,159,811 → 9,479,434 → 4,739,717 → 14,219,152 → 7,109,576 → 3,554,788 → 1,777,394 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage421,308,100%
4,213,081% as a decimal42,130.81
4,213,081% of 1004,213,081
4,213,081% of 1,00042,130,810
As a fraction of 1004,213,081/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 4,213,081
Nerdulate something else
Nothing in mind? Surprise me · today’s page