Recognised as Number
4,042,807
- Positive
- Odd
- Prime
- 7 digits
4,042,807 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 value4,042,807
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation4,042,807
Distinct prime factors14,042,807
Number of divisors2
Sum of divisors σ(n)4,042,808
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,042,806integers below n that share no factor with it
Carmichael function λ(n)4,042,806the 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,042,8072 in total
Arithmetic
Previous number4,042,806
Next number4,042,808
Double8,085,614
Half2,021,403.5
Square16,344,288,439,249
Cube66,076,803,712,214,931,943
Square root2,010.673270325≈irrational, shown to 9 decimal places
Cube root159.304362751≈
Negation-4,042,807
Reciprocal2.47352891 × 10^-7≈
Representations
Decimal4,042,807
Binary111101101100000011011122 bits
Octal17330067
Hexadecimal3DB037
Base 362ENG7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, forty-two thousand, eight hundred and seven
Ordinalfour million, forty-two thousand, eight hundred and seventh
Scientific notation4.042807 × 10^6
Engineering notation4.042807 × 10^6
In other bases
Ternary21121101200121base 3; the most digit-efficient integer base after e: 14 digits
Quinary2013332212base 5; one hand: 10 digits
Septenary46235416base 7: 8 digits
Nonary7541617base 9; each digit is two ternary digits: 7 digits
Duodecimal142b707base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal155707base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:43:0:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT111TT01TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000101111000001001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111011011000000110111
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
Bytes33d b0 37
Gray code1000110110100000101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111011011000000110111
64-bit0000000000000000000000000000000000000000001111011011000000110111
One's complement11111111110000100100111111001000at 32 bits, every bit flipped
Bits reversed11101100000011011011110000000000at 32 bits
Rotated left by 100000000011110110110000001101110at 32 bits, wrapping
Shifted left by 111110110110000001101110= 8,085,614, no wrap
Shifted right by 1111101101100000011011= 2,021,403, discarding the low bit
These bits as a double1.99741205 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,042,807 to the power 216,344,288,439,249
4,042,807 to the power 366,076,803,712,214,931,943
4,042,807 to the power 4267,135,764,585,368,512,363,684,001
4,042,807 to the power 51,079,978,339,016,079,919,363,488,225,030,807
First ten multiples4,042,807, 8,085,614, 12,128,421, 16,171,228, 20,214,035, 24,256,842, 28,299,649, 32,342,456, 36,385,263, 40,428,070
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1229the total stopping time
Highest value reached34,537,5888× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,042,807 → 12,128,422 → 6,064,211 → 18,192,634 → 9,096,317 → 27,288,952 → 13,644,476 → 6,822,238 → 3,411,119 → 10,233,358 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage404,280,700%
4,042,807% as a decimal40,428.07
4,042,807% of 1004,042,807
4,042,807% of 1,00040,428,070
As a fraction of 1004,042,807/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,042,807
Nerdulate something else
Nothing in mind? Surprise me · today’s page