Nerdulator> put something in

Recognised as Number

2,219,141

  • Positive
  • Odd
  • Prime
  • 7 digits

2,219,141 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,219,141
Digit count7
Digit sum20
Digit product144
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2,219,141
Distinct prime factors12,219,141
Number of divisors2
Sum of divisors σ(n)2,219,142
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,219,140integers below n that share no factor with it
Carmichael function λ(n)2,219,140the 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, 2,219,1412 in total

Arithmetic

Previous number2,219,140
Next number2,219,142
Double4,438,282
Cube10,928,352,426,853,620,221
Square root1,489.678153159≈irrational, shown to 9 decimal places
Cube root130.435247256≈
Negation-2,219,141
Reciprocal4.50624814 × 10^-7≈

Representations

Decimal2,219,141
Binary100001110111001000010122 bits
Octal10356205
Hexadecimal21DC85
Base 361BKAT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and nineteen thousand, one hundred and forty-one
Ordinaltwo million, two hundred and nineteen thousand, one hundred and forty-first
Scientific notation2.219141 × 10^6
Engineering notation2.219141 × 10^6

In other bases

Ternary11011202002102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1032003031base 5; one hand: 10 digits
Septenary24601541base 7: 8 digits
Nonary4152072base 9; each digit is two ternary digits: 7 digits
Duodecimal8b0285base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldh7h1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:16:25:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111TTT1T01T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100010110110000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001000011101110010000101
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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
Bytes321 dc 85
Gray code1100010011001011000111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001000011101110010000101
64-bit0000000000000000000000000000000000000000001000011101110010000101
One's complement11111111110111100010001101111010at 32 bits, every bit flipped
Bits reversed10100001001110111000010000000000at 32 bits
Rotated left by 100000000010000111011100100001010at 32 bits, wrapping
Shifted left by 110000111011100100001010= 4,438,282, no wrap
Shifted right by 1100001110111001000010= 1,109,570, discarding the low bit
These bits as a double1.09640133 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,219,153+12
Previous prime2,219,137−4
Distance to nearest prime0, it is prime
Nearest square below2,217,121
Nearest square above2,220,100

Powers & multiples

2,219,141 to the power 24,924,586,777,881
2,219,141 to the power 310,928,352,426,853,620,221
2,219,141 to the power 424,251,554,932,880,369,630,850,161
2,219,141 to the power 553,817,619,865,307,076,342,974,457,131,701
First ten multiples2,219,141, 4,438,282, 6,657,423, 8,876,564, 11,095,705, 13,314,846, 15,533,987, 17,753,128, 19,972,269, 22,191,410
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 1285the total stopping time
Highest value reached6,657,4243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,219,141 → 6,657,424 → 3,328,712 → 1,664,356 → 832,178 → 416,089 → 1,248,268 → 624,134 → 312,067 → 936,202 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage221,914,100%
2,219,141% as a decimal22,191.41
2,219,141% of 1002,219,141
2,219,141% of 1,00022,191,410
As a fraction of 1002,219,141/100

Read another way

As bytes2.116 MiB
As a 24-bit colour#21DC85

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