Recognised as Number
4,162,477
- Positive
- Odd
- Composite
- 7 digits
4,162,477 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,162,477
Digit count7
Digit sum31
Digit product9,408
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11 × 378,407
Distinct prime factors211, 378,407
Number of divisors4
Sum of divisors σ(n)4,540,896
Aliquot sum378,419sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,784,060integers below n that share no factor with it
Carmichael function λ(n)1,892,030the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,784,060
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 378,407, 4,162,4774 in total
Arithmetic
Previous number4,162,476
Next number4,162,478
Double8,324,954
Half2,081,238.5
Square17,326,214,775,529
Cube72,119,970,500,199,625,333
Square root2,040.214939657≈irrational, shown to 9 decimal places
Cube root160.860944964≈
Negation-4,162,477
Reciprocal2.40241568 × 10^-7≈
Representations
Decimal4,162,477
Binary111111100000111010110122 bits
Octal17701655
Hexadecimal3F83AD
Base 362H7SD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and sixty-two thousand, four hundred and seventy-seven
Ordinalfour million, one hundred and sixty-two thousand, four hundred and seventy-seventh
Scientific notation4.162477 × 10^6
Engineering notation4.162477 × 10^6
In other bases
Ternary21211110211211base 3; the most digit-efficient integer base after e: 14 digits
Quinary2031144402base 5; one hand: 10 digits
Septenary50244334base 7: 8 digits
Nonary7743754base 9; each digit is two ternary digits: 7 digits
Duodecimal1488a11base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal16063hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:16:14:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT111110TTT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001000010011111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111111000001110101101
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 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
Bytes33f 83 ad
Gray code1000000100001001111011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111111000001110101101
64-bit0000000000000000000000000000000000000000001111111000001110101101
One's complement11111111110000000111110001010010at 32 bits, every bit flipped
Bits reversed10110101110000011111110000000000at 32 bits
Rotated left by 100000000011111110000011101011010at 32 bits, wrapping
Shifted left by 111111110000011101011010= 8,324,954, no wrap
Shifted right by 1111111100000111010110= 2,081,238, discarding the low bit
These bits as a double2.05653689 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,162,477 to the power 217,326,214,775,529
4,162,477 to the power 372,119,970,500,199,625,333
4,162,477 to the power 4300,197,718,447,759,435,857,229,841
4,162,477 to the power 51,249,566,098,491,274,353,288,694,496,876,157
First ten multiples4,162,477, 8,324,954, 12,487,431, 16,649,908, 20,812,385, 24,974,862, 29,137,339, 33,299,816, 37,462,293, 41,624,770
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 1198the total stopping time
Highest value reached12,487,4323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,162,477 → 12,487,432 → 6,243,716 → 3,121,858 → 1,560,929 → 4,682,788 → 2,341,394 → 1,170,697 → 3,512,092 → 1,756,046 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage416,247,700%
4,162,477% as a decimal41,624.77
4,162,477% of 1004,162,477
4,162,477% of 1,00041,624,770
As a fraction of 1004,162,477/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,162,477
Nerdulate something else
Nothing in mind? Surprise me · today’s page