Recognised as Number
4,172,470
- Positive
- Even
- Composite
- 7 digits
4,172,470 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,172,470
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 factorisation2 × 5 × 397 × 1,051
Distinct prime factors42, 5, 397, 1,051
Number of divisors16
Sum of divisors σ(n)7,536,528
Aliquot sum3,364,058sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,663,200integers below n that share no factor with it
Carmichael function λ(n)69,300the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,663,200
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 397, 794, 1,051, 1,985, 2,102, 3,970, 5,255, 10,510, 417,247, 834,494, 2,086,235, 4,172,47016 in total
Arithmetic
Previous number4,172,469
Next number4,172,471
Double8,344,940
Half2,086,235
Square17,409,505,900,900
Cube72,640,641,086,328,223,000
Square root2,042.662478238≈irrational, shown to 9 decimal places
Cube root160.9895702≈
Negation-4,172,470
Reciprocal2.39666193 × 10^-7≈
Representations
Decimal4,172,470
Binary111111101010101011011022 bits
Octal17725266
Hexadecimal3FAAB6
Base 362HFHY
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and seventy-two thousand, four hundred and seventy
Ordinalfour million, one hundred and seventy-two thousand, four hundred and seventieth
Scientific notation4.17247 × 10^6
Engineering notation4.17247 × 10^6
In other bases
Ternary21211222112221base 3; the most digit-efficient integer base after e: 14 digits
Quinary2032004340base 5; one hand: 10 digits
Septenary50315431base 7: 8 digits
Nonary7758487base 9; each digit is two ternary digits: 7 digits
Duodecimal149275abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal161b3abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:19:1:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0TT000TT00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001111111111001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111111010101010110110
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 set bits, so odd; 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 aa b6
Gray code1000000111111111101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111111010101010110110
64-bit0000000000000000000000000000000000000000001111111010101010110110
One's complement11111111110000000101010101001001at 32 bits, every bit flipped
Bits reversed01101101010101011111110000000000at 32 bits
Rotated left by 100000000011111110101010101101100at 32 bits, wrapping
Shifted left by 111111110101010101101100= 8,344,940, no wrap
Shifted right by 1111111101010101011011= 2,086,235, discarding the low bit
These bits as a double2.06147409 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,172,470 to the power 217,409,505,900,900
4,172,470 to the power 372,640,641,086,328,223,000
4,172,470 to the power 4303,090,895,713,471,920,620,810,000
4,172,470 to the power 51,264,637,669,637,590,184,632,711,100,700,000
First ten multiples4,172,470, 8,344,940, 12,517,410, 16,689,880, 20,862,350, 25,034,820, 29,207,290, 33,379,760, 37,552,230, 41,724,700
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 6
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 5
Divisible by 12No, remainder 10
Divisible by 100No, remainder 70
Collatz (3n + 1) trajectory
Steps to reach 1180the total stopping time
Highest value reached15,842,3563× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,172,470 → 2,086,235 → 6,258,706 → 3,129,353 → 9,388,060 → 4,694,030 → 2,347,015 → 7,041,046 → 3,520,523 → 10,561,570 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage417,247,000%
4,172,470% as a decimal41,724.7
4,172,470% of 1004,172,470
4,172,470% of 1,00041,724,700
As a fraction of 1004,172,470/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,172,470
Nerdulate something else
Nothing in mind? Surprise me · today’s page