Nerdulator> put something in

Recognised as Number

2,174,423

  • Positive
  • Odd
  • Prime
  • 7 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,174,423
Digit count7
Digit sum23
Digit product1,344
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

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

Arithmetic

Previous number2,174,422
Next number2,174,424
Double4,348,846
Cube10,280,922,835,294,624,967
Square root1,474.592486079≈irrational, shown to 9 decimal places
Cube root129.553160149≈
Negation-2,174,423
Reciprocal4.59892119 × 10^-7≈

Representations

Decimal2,174,423
Binary100001001011011101011122 bits
Octal10226727
Hexadecimal212DD7
Base 361ALSN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and seventy-four thousand, four hundred and twenty-three
Ordinaltwo million, one hundred and seventy-four thousand, four hundred and twenty-third
Scientific notation2.174423 × 10^6
Engineering notation2.174423 × 10^6

In other bases

Ternary11002110202012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1024040143base 5; one hand: 10 digits
Septenary24324266base 7: 8 digits
Nonary4073665base 9; each digit is two ternary digits: 7 digits
Duodecimal88a41bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldbg13base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:4:0:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1101T111T1T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000010111001000101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001000010010110111010111
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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 2d d7
Gray code1100011011101100111100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001000010010110111010111
64-bit0000000000000000000000000000000000000000001000010010110111010111
One's complement11111111110111101101001000101000at 32 bits, every bit flipped
Bits reversed11101011101101001000010000000000at 32 bits
Rotated left by 100000000010000100101101110101110at 32 bits, wrapping
Shifted left by 110000100101101110101110= 4,348,846, no wrap
Shifted right by 1100001001011011101011= 1,087,211, discarding the low bit
These bits as a double1.0743077 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,174,461+38
Previous prime2,174,407−16
Distance to nearest prime0, it is prime
Nearest square below2,172,676
Nearest square above2,175,625

Powers & multiples

2,174,423 to the power 24,728,115,382,929
2,174,423 to the power 310,280,922,835,294,624,967
2,174,423 to the power 422,355,075,074,289,844,304,619,041
2,174,423 to the power 548,609,389,408,262,546,122,382,648,988,343
First ten multiples2,174,423, 4,348,846, 6,523,269, 8,697,692, 10,872,115, 13,046,538, 15,220,961, 17,395,384, 19,569,807, 21,744,230
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 11
Divisible by 100No, remainder 23

Collatz (3n + 1) trajectory

Steps to reach 1210the total stopping time
Highest value reached14,677,3606× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,174,423 → 6,523,270 → 3,261,635 → 9,784,906 → 4,892,453 → 14,677,360 → 7,338,680 → 3,669,340 → 1,834,670 → 917,335 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage217,442,300%
2,174,423% as a decimal21,744.23
2,174,423% of 1002,174,423
2,174,423% of 1,00021,744,230
As a fraction of 1002,174,423/100

Read another way

As bytes2.074 MiB
As a 24-bit colour#212DD7

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