Recognised as Number
2,364,247
- Positive
- Odd
- Prime
- 7 digits
2,364,247 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,364,247
Digit count7
Digit sum28
Digit product8,064
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,364,247
Distinct prime factors12,364,247
Number of divisors2
Sum of divisors σ(n)2,364,248
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,364,246integers below n that share no factor with it
Carmichael function λ(n)2,364,246the 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,364,2472 in total
Arithmetic
Previous number2,364,246
Next number2,364,248
Double4,728,494
Half1,182,123.5
Square5,589,663,877,009
Cube13,215,346,052,226,897,223
Square root1,537.610809015≈irrational, shown to 9 decimal places
Cube root133.218421131≈
Negation-2,364,247
Reciprocal4.22967651 × 10^-7≈
Representations
Decimal2,364,247
Binary100100000100110101011122 bits
Octal11011527
Hexadecimal241357
Base 361EO9J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and sixty-four thousand, two hundred and forty-seven
Ordinaltwo million, three hundred and sixty-four thousand, two hundred and forty-seventh
Scientific notation2.364247 × 10^6
Engineering notation2.364247 × 10^6
In other bases
Ternary11110010010201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1101123442base 5; one hand: 10 digits
Septenary26044564base 7: 8 digits
Nonary4403121base 9; each digit is two ternary digits: 7 digits
Duodecimal960247base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalefac7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:56:44:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11110010011T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001000001010010101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001000001001101010111
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
Bytes324 13 57
Gray code1101100001101011111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001000001001101010111
64-bit0000000000000000000000000000000000000000001001000001001101010111
One's complement11111111110110111110110010101000at 32 bits, every bit flipped
Bits reversed11101010110010000010010000000000at 32 bits
Rotated left by 100000000010010000010011010101110at 32 bits, wrapping
Shifted left by 110010000010011010101110= 4,728,494, no wrap
Shifted right by 1100100000100110101011= 1,182,123, discarding the low bit
These bits as a double1.16809322 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,364,247 to the power 25,589,663,877,009
2,364,247 to the power 313,215,346,052,226,897,223
2,364,247 to the power 431,244,342,257,939,285,078,786,081
2,364,247 to the power 573,869,342,450,306,180,929,664,755,646,007
First ten multiples2,364,247, 4,728,494, 7,092,741, 9,456,988, 11,821,235, 14,185,482, 16,549,729, 18,913,976, 21,278,223, 23,642,470
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1236the total stopping time
Highest value reached15,958,6726× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,364,247 → 7,092,742 → 3,546,371 → 10,639,114 → 5,319,557 → 15,958,672 → 7,979,336 → 3,989,668 → 1,994,834 → 997,417 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage236,424,700%
2,364,247% as a decimal23,642.47
2,364,247% of 1002,364,247
2,364,247% of 1,00023,642,470
As a fraction of 1002,364,247/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 2,364,247
Nerdulate something else
Nothing in mind? Surprise me · today’s page