Recognised as Number
4,404,107
- Positive
- Odd
- Prime
- 7 digits
4,404,107 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,404,107
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,404,107
Distinct prime factors14,404,107
Number of divisors2
Sum of divisors σ(n)4,404,108
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,404,106integers below n that share no factor with it
Carmichael function λ(n)4,404,106the 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,404,1072 in total
Arithmetic
Previous number4,404,106
Next number4,404,108
Double8,808,214
Half2,202,053.5
Square19,396,158,467,449
Cube85,422,757,279,601,413,043
Square root2,098.596435716≈irrational, shown to 9 decimal places
Cube root163.915222393≈
Negation-4,404,107
Reciprocal2.27060787 × 10^-7≈
Representations
Decimal4,404,107
Binary1000011001100111000101123 bits
Octal20631613
Hexadecimal43338B
Base 362ME8B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, four hundred and four thousand, one hundred and seven
Ordinalfour million, four hundred and four thousand, one hundred and seventh
Scientific notation4.404107 × 10^6
Engineering notation4.404107 × 10^6
In other bases
Ternary22021202022002base 3; the most digit-efficient integer base after e: 14 digits
Quinary2111412412base 5; one hand: 10 digits
Septenary52301651base 7: 8 digits
Nonary8252262base 9; each digit is two ternary digits: 7 digits
Duodecimal158480bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal17aa57base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:23:21:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T10TT1T10T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001110111010010011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000110011001110001011
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 set bits, so odd; 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
Bytes343 33 8b
Gray code11000101010101001001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000110011001110001011
64-bit0000000000000000000000000000000000000000010000110011001110001011
One's complement11111111101111001100110001110100at 32 bits, every bit flipped
Bits reversed11010001110011001100001000000000at 32 bits
Rotated left by 100000000100001100110011100010110at 32 bits, wrapping
Shifted left by 1100001100110011100010110= 8,808,214, no wrap
Shifted right by 11000011001100111000101= 2,202,053, discarding the low bit
These bits as a double2.17591797 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,404,107 to the power 219,396,158,467,449
4,404,107 to the power 385,422,757,279,601,413,043
4,404,107 to the power 4376,210,963,294,393,540,392,567,601
4,404,107 to the power 51,656,873,336,921,581,651,997,689,719,537,307
First ten multiples4,404,107, 8,808,214, 13,212,321, 17,616,428, 22,020,535, 26,424,642, 30,828,749, 35,232,856, 39,636,963, 44,041,070
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1229the total stopping time
Highest value reached549,800,116124× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,404,107 → 13,212,322 → 6,606,161 → 19,818,484 → 9,909,242 → 4,954,621 → 14,863,864 → 7,431,932 → 3,715,966 → 1,857,983 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage440,410,700%
4,404,107% as a decimal44,041.07
4,404,107% of 1004,404,107
4,404,107% of 1,00044,041,070
As a fraction of 1004,404,107/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,404,107
Nerdulate something else
Nothing in mind? Surprise me · today’s page