Nerdulator> put something in

Recognised as Number

2,309,491

  • Positive
  • Odd
  • Prime
  • 7 digits

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

Arithmetic

Previous number2,309,490
Next number2,309,492
Double4,618,982
Cube12,318,244,570,599,457,771
Square root1,519.700957426≈irrational, shown to 9 decimal places
Cube root132.181930801≈
Negation-2,309,491
Reciprocal4.32995842 × 10^-7≈

Representations

Decimal2,309,491
Binary100011001111010111001122 bits
Octal10636563
Hexadecimal233D73
Base 361DI0J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and nine thousand, four hundred and ninety-one
Ordinaltwo million, three hundred and nine thousand, four hundred and ninety-first
Scientific notation2.309491 × 10^6
Engineering notation2.309491 × 10^6

In other bases

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

Bit-level

00000000001000110011110101110011
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; 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
Bytes323 3d 73
Gray code1100101010001111001010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001000110011110101110011
64-bit0000000000000000000000000000000000000000001000110011110101110011
One's complement11111111110111001100001010001100at 32 bits, every bit flipped
Bits reversed11001110101111001100010000000000at 32 bits
Rotated left by 100000000010001100111101011100110at 32 bits, wrapping
Shifted left by 110001100111101011100110= 4,618,982, no wrap
Shifted right by 1100011001111010111001= 1,154,745, discarding the low bit
These bits as a double1.14104016 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,309,497+6
Previous prime2,309,477−14
Distance to nearest prime0, it is prime
Nearest square below2,307,361
Nearest square above2,310,400

Powers & multiples

2,309,491 to the power 25,333,748,679,081
2,309,491 to the power 312,318,244,570,599,457,771
2,309,491 to the power 428,448,874,971,598,312,327,004,561
2,309,491 to the power 565,702,420,707,031,557,934,406,090,588,451
First ten multiples2,309,491, 4,618,982, 6,928,473, 9,237,964, 11,547,455, 13,856,946, 16,166,437, 18,475,928, 20,785,419, 23,094,910
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 173the total stopping time
Highest value reached10,392,7124× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,309,491 → 6,928,474 → 3,464,237 → 10,392,712 → 5,196,356 → 2,598,178 → 1,299,089 → 3,897,268 → 1,948,634 → 974,317 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage230,949,100%
2,309,491% as a decimal23,094.91
2,309,491% of 1002,309,491
2,309,491% of 1,00023,094,910
As a fraction of 1002,309,491/100

Read another way

As bytes2.203 MiB
As a 24-bit colour#233D73

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