Nerdulator> put something in

Recognised as Number

4,172,059

  • Positive
  • Odd
  • Prime
  • 7 digits

4,172,059 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,172,059
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation4,172,059
Distinct prime factors14,172,059
Number of divisors2
Sum of divisors σ(n)4,172,060
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,172,058integers below n that share no factor with it
Carmichael function λ(n)4,172,058the 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,0592 in total

Arithmetic

Previous number4,172,058
Next number4,172,060
Double8,344,118
Cube72,619,177,279,936,401,379
Square root2,042.561871768≈irrational, shown to 9 decimal places
Cube root160.984284052≈
Negation-4,172,059
Reciprocal2.39689803 × 10^-7≈

Representations

Decimal4,172,059
Binary111111101010010001101122 bits
Octal17724433
Hexadecimal3FA91B
Base 362HF6J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and seventy-two thousand and fifty-nine
Ordinalfour million, one hundred and seventy-two thousand and fifty-ninth
Scientific notation4.172059 × 10^6
Engineering notation4.172059 × 10^6

In other bases

Ternary21211221222201base 3; the most digit-efficient integer base after e: 14 digits
Quinary2032001214base 5; one hand: 10 digits
Septenary50314303base 7: 8 digits
Nonary7757881base 9; each digit is two ternary digits: 7 digits
Duodecimal1492477base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal161a2jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:18:54:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0TT00T000T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001111100101101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001111111010100100011011
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 a9 1b
Gray code1000000111110110010110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001111111010100100011011
64-bit0000000000000000000000000000000000000000001111111010100100011011
One's complement11111111110000000101011011100100at 32 bits, every bit flipped
Bits reversed11011000100101011111110000000000at 32 bits
Rotated left by 100000000011111110101001000110110at 32 bits, wrapping
Shifted left by 111111110101001000110110= 8,344,118, no wrap
Shifted right by 1111111101010010001101= 2,086,029, discarding the low bit
These bits as a double2.06127102 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,172,071+12
Previous prime4,172,057−2
Distance to nearest prime0, it is prime
Nearest square below4,169,764
Nearest square above4,173,849

Powers & multiples

4,172,059 to the power 217,406,076,299,481
4,172,059 to the power 372,619,177,279,936,401,379
4,172,059 to the power 4302,971,492,143,354,182,800,869,361
4,172,059 to the power 51,264,014,940,540,110,108,542,012,225,384,299
First ten multiples4,172,059, 8,344,118, 12,516,177, 16,688,236, 20,860,295, 25,032,354, 29,204,413, 33,376,472, 37,548,531, 41,720,590
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 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 1180the total stopping time
Highest value reached106,925,34425× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,172,059 → 12,516,178 → 6,258,089 → 18,774,268 → 9,387,134 → 4,693,567 → 14,080,702 → 7,040,351 → 21,121,054 → 10,560,527 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage417,205,900%
4,172,059% as a decimal41,720.59
4,172,059% of 1004,172,059
4,172,059% of 1,00041,720,590
As a fraction of 1004,172,059/100

Read another way

As bytes3.979 MiB
As a 24-bit colour#3FA91B

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “4172059” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.