Recognised as Number
4,137,330
- Positive
- Even
- Composite
- 7 digits
4,137,330 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,137,330
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 5 × 137,911
Distinct prime factors42, 3, 5, 137,911
Number of divisors16
Sum of divisors σ(n)9,929,664
Aliquot sum5,792,334sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,103,280integers below n that share no factor with it
Carmichael function λ(n)275,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,103,280
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 5, 6, 10, 15, 30, 137,911, 275,822, 413,733, 689,555, 827,466, 1,379,110, 2,068,665, 4,137,33016 in total
Arithmetic
Previous number4,137,329
Next number4,137,331
Double8,274,660
Half2,068,665
Square17,117,499,528,900
Cube70,820,744,325,903,837,000
Square root2,034.042772412≈irrational, shown to 9 decimal places
Cube root160.53635108≈
Negation-4,137,330
Reciprocal2.41701774 × 10^-7≈
Representations
Decimal4,137,330
Binary111111001000010111001022 bits
Octal17620562
Hexadecimal3F2172
Base 362GODU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and thirty-seven thousand, three hundred and thirty
Ordinalfour million, one hundred and thirty-seven thousand, three hundred and thirtieth
Scientific notation4.13733 × 10^6
Engineering notation4.13733 × 10^6
In other bases
Ternary21210012100110base 3; the most digit-efficient integer base after e: 14 digits
Quinary2024343310base 5; one hand: 10 digits
Septenary50111121base 7: 8 digits
Nonary7705313base 9; each digit is two ternary digits: 7 digits
Duodecimal1476356base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal15h36abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:9:15:30base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT101TT100110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000110110011010110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111110010000101110010
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes33f 21 72
Gray code1000001011000111001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111110010000101110010
64-bit0000000000000000000000000000000000000000001111110010000101110010
One's complement11111111110000001101111010001101at 32 bits, every bit flipped
Bits reversed01001110100001001111110000000000at 32 bits
Rotated left by 100000000011111100100001011100100at 32 bits, wrapping
Shifted left by 111111100100001011100100= 8,274,660, no wrap
Shifted right by 1111111001000010111001= 2,068,665, discarding the low bit
These bits as a double2.04411262 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,137,330 to the power 217,117,499,528,900
4,137,330 to the power 370,820,744,325,903,837,000
4,137,330 to the power 4293,008,790,121,891,721,935,210,000
4,137,330 to the power 51,212,274,057,635,006,277,914,202,389,300,000
First ten multiples4,137,330, 8,274,660, 12,411,990, 16,549,320, 20,686,650, 24,823,980, 28,961,310, 33,098,640, 37,235,970, 41,373,300
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 3
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 6
Divisible by 100No, remainder 30
Collatz (3n + 1) trajectory
Steps to reach 1198the total stopping time
Highest value reached6,981,7481× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,137,330 → 2,068,665 → 6,205,996 → 3,102,998 → 1,551,499 → 4,654,498 → 2,327,249 → 6,981,748 → 3,490,874 → 1,745,437 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage413,733,000%
4,137,330% as a decimal41,373.3
4,137,330% of 1004,137,330
4,137,330% of 1,00041,373,300
As a fraction of 1004,137,330/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,137,330
Nerdulate something else
Nothing in mind? Surprise me · today’s page