Recognised as Number
4,172,479
- Positive
- Odd
- Prime
- 7 digits
4,172,479 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,172,479
Digit count7
Digit sum34
Digit product14,112
Multiplicative persistence2times 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,172,479
Distinct prime factors14,172,479
Number of divisors2
Sum of divisors σ(n)4,172,480
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,172,478integers below n that share no factor with it
Carmichael function λ(n)4,172,478the 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,172,4792 in total
Arithmetic
Previous number4,172,478
Next number4,172,480
Double8,344,958
Half2,086,239.5
Square17,409,581,005,441
Cube72,641,111,144,001,458,239
Square root2,042.664681244≈irrational, shown to 9 decimal places
Cube root160.989685951≈
Negation-4,172,479
Reciprocal2.39665676 × 10^-7≈
Representations
Decimal4,172,479
Binary111111101010101011111122 bits
Octal17725277
Hexadecimal3FAABF
Base 362HFI7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and seventy-two thousand, four hundred and seventy-nine
Ordinalfour million, one hundred and seventy-two thousand, four hundred and seventy-ninth
Scientific notation4.172479 × 10^6
Engineering notation4.172479 × 10^6
In other bases
Ternary21211222120021base 3; the most digit-efficient integer base after e: 14 digits
Quinary2032004404base 5; one hand: 10 digits
Septenary50315443base 7: 8 digits
Nonary7758507base 9; each digit is two ternary digits: 7 digits
Duodecimal1492767base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal161b3jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:19:1:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0TT000TT01T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001111111111000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111111010101010111111
Bit length22 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits5within that length
Bit parityodd17 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
Bytes33f aa bf
Gray code1000000111111111100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111111010101010111111
64-bit0000000000000000000000000000000000000000001111111010101010111111
One's complement11111111110000000101010101000000at 32 bits, every bit flipped
Bits reversed11111101010101011111110000000000at 32 bits
Rotated left by 100000000011111110101010101111110at 32 bits, wrapping
Shifted left by 111111110101010101111110= 8,344,958, no wrap
Shifted right by 1111111101010101011111= 2,086,239, discarding the low bit
These bits as a double2.06147853 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,172,479 to the power 217,409,581,005,441
4,172,479 to the power 372,641,111,144,001,458,239
4,172,479 to the power 4303,093,510,785,012,060,471,604,481
4,172,479 to the power 51,264,651,308,786,736,337,064,499,793,278,399
First ten multiples4,172,479, 8,344,958, 12,517,437, 16,689,916, 20,862,395, 25,034,874, 29,207,353, 33,379,832, 37,552,311, 41,724,790
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1105the total stopping time
Highest value reached135,341,00832× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,172,479 → 12,517,438 → 6,258,719 → 18,776,158 → 9,388,079 → 28,164,238 → 14,082,119 → 42,246,358 → 21,123,179 → 63,369,538 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage417,247,900%
4,172,479% as a decimal41,724.79
4,172,479% of 1004,172,479
4,172,479% of 1,00041,724,790
As a fraction of 1004,172,479/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,479
Nerdulate something else
Nothing in mind? Surprise me · today’s page