Nerdulator> put something in

Recognised as Number

4,195,071

  • Positive
  • Odd
  • Composite
  • 7 digits

4,195,071 is an odd 7-digit integer and a composite number. It has 20 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,195,071
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^4 × 67 × 773
Distinct prime factors33, 67, 773
Number of divisors20
Sum of divisors σ(n)6,368,472
Aliquot sum2,173,401sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,751,408integers below n that share no factor with it
Carmichael function λ(n)229,284the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,751,408
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 67, 81, 201, 603, 773, 1,809, 2,319, 5,427, 6,957, 20,871, 51,791, 62,613, 155,373, 466,119, 1,398,357, 4,195,07120 in total

Arithmetic

Previous number4,195,070
Next number4,195,072
Double8,390,142
Cube73,827,463,317,766,342,911
Square root2,048.187247299≈irrational, shown to 9 decimal places
Cube root161.279724104≈
Negation-4,195,071
Reciprocal2.38374988 × 10^-7≈

Representations

Decimal4,195,071
Binary1000000000000101111111123 bits
Octal20001377
Hexadecimal4002FF
Base 362HWXR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and ninety-five thousand and seventy-one
Ordinalfour million, one hundred and ninety-five thousand and seventy-first
Scientific notation4.195071 × 10^6
Engineering notation4.195071 × 10^6

In other bases

Ternary21220010120000base 3; the most digit-efficient integer base after e: 14 digits
Quinary2033220241base 5; one hand: 10 digits
Septenary50441346base 7: 8 digits
Nonary7803500base 9; each digit is two ternary digits: 7 digits
Duodecimal14a3853base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1647dbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:25:17:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T0011TT0000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000000000011100000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010000000000001011111111
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes340 02 ff
Gray code11000000000001110000000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010000000000001011111111
64-bit0000000000000000000000000000000000000000010000000000001011111111
One's complement11111111101111111111110100000000at 32 bits, every bit flipped
Bits reversed11111111010000000000001000000000at 32 bits
Rotated left by 100000000100000000000010111111110at 32 bits, wrapping
Shifted left by 1100000000000010111111110= 8,390,142, no wrap
Shifted right by 11000000000000101111111= 2,097,535, discarding the low bit
These bits as a double2.07264046 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,195,117+46
Previous prime4,195,063−8
Distance to nearest prime8
Nearest square below4,194,304
Nearest square above4,198,401

Powers & multiples

4,195,071 to the power 217,598,620,695,041
4,195,071 to the power 373,827,463,317,766,342,911
4,195,071 to the power 4309,711,450,367,925,369,921,991,681
4,195,071 to the power 51,299,261,523,806,423,049,524,019,563,204,351
First ten multiples4,195,071, 8,390,142, 12,585,213, 16,780,284, 20,975,355, 25,170,426, 29,365,497, 33,560,568, 37,755,639, 41,950,710
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1105the total stopping time
Highest value reached215,030,21251× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,195,071 → 12,585,214 → 6,292,607 → 18,877,822 → 9,438,911 → 28,316,734 → 14,158,367 → 42,475,102 → 21,237,551 → 63,712,654 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage419,507,100%
4,195,071% as a decimal41,950.71
4,195,071% of 1004,195,071
4,195,071% of 1,00041,950,710
As a fraction of 1004,195,071/100

Read another way

As bytes4.001 MiB
As a 24-bit colour#4002FF

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 “4195071” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.