Nerdulator> put something in

Recognised as Number

2,461,397

  • Positive
  • Odd
  • Prime
  • 7 digits

2,461,397 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,461,397
Digit count7
Digit sum32
Digit product9,072
Multiplicative persistence2times 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,461,397
Distinct prime factors12,461,397
Number of divisors2
Sum of divisors σ(n)2,461,398
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,461,396integers below n that share no factor with it
Carmichael function λ(n)2,461,396the 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,461,3972 in total

Arithmetic

Previous number2,461,396
Next number2,461,398
Double4,922,794
Cube14,912,312,661,200,817,773
Square root1,568.883998261≈irrational, shown to 9 decimal places
Cube root135.018689685≈
Negation-2,461,397
Reciprocal4.06273348 × 10^-7≈

Representations

Decimal2,461,397
Binary100101100011101101010122 bits
Octal11307325
Hexadecimal258ED5
Base 361GR85
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and sixty-one thousand, three hundred and ninety-seven
Ordinaltwo million, four hundred and sixty-one thousand, three hundred and ninety-seventh
Scientific notation2.461397 × 10^6
Engineering notation2.461397 × 10^6

In other bases

Ternary11122001101212base 3; the most digit-efficient integer base after e: 14 digits
Quinary1112231042base 5; one hand: 10 digits
Septenary26631041base 7: 8 digits
Nonary4561355base 9; each digit is two ternary digits: 7 digits
Duodecimal9a8505base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalf7d9hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:23:43:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT0T00111T0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110101001001111010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001001011000111011010101
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
Bytes325 8e d5
Gray code1101110100100110111111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001001011000111011010101
64-bit0000000000000000000000000000000000000000001001011000111011010101
One's complement11111111110110100111000100101010at 32 bits, every bit flipped
Bits reversed10101011011100011010010000000000at 32 bits
Rotated left by 100000000010010110001110110101010at 32 bits, wrapping
Shifted left by 110010110001110110101010= 4,922,794, no wrap
Shifted right by 1100101100011101101010= 1,230,698, discarding the low bit
These bits as a double1.2160917 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,461,399+2
Previous prime2,461,339−58
Distance to nearest prime0, it is prime
Nearest square below2,458,624
Nearest square above2,461,761

Powers & multiples

2,461,397 to the power 26,058,475,191,609
2,461,397 to the power 314,912,312,661,200,817,773
2,461,397 to the power 436,705,121,647,341,709,264,008,881
2,461,397 to the power 590,345,876,307,401,941,157,303,667,666,757
First ten multiples2,461,397, 4,922,794, 7,384,191, 9,845,588, 12,306,985, 14,768,382, 17,229,779, 19,691,176, 22,152,573, 24,613,970
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 97

Collatz (3n + 1) trajectory

Steps to reach 1174the total stopping time
Highest value reached7,384,1923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,461,397 → 7,384,192 → 3,692,096 → 1,846,048 → 923,024 → 461,512 → 230,756 → 115,378 → 57,689 → 173,068 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage246,139,700%
2,461,397% as a decimal24,613.97
2,461,397% of 1002,461,397
2,461,397% of 1,00024,613,970
As a fraction of 1002,461,397/100

Read another way

As bytes2.347 MiB
As a 24-bit colour#258ED5

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