Recognised as Number
2,323,463
- Positive
- Odd
- Prime
- 7 digits
2,323,463 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,323,463
Digit count7
Digit sum23
Digit product2,592
Multiplicative persistence3times 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,323,463
Distinct prime factors12,323,463
Number of divisors2
Sum of divisors σ(n)2,323,464
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,323,462integers below n that share no factor with it
Carmichael function λ(n)2,323,462the 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,323,4632 in total
Arithmetic
Previous number2,323,462
Next number2,323,464
Double4,646,926
Half1,161,731.5
Square5,398,480,312,369
Cube12,543,169,262,017,813,847
Square root1,524.29098272≈irrational, shown to 9 decimal places
Cube root132.447953927≈
Negation-2,323,463
Reciprocal4.30392048 × 10^-7≈
Representations
Decimal2,323,463
Binary100011011101000000011122 bits
Octal10672007
Hexadecimal237407
Base 361DSSN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and twenty-three thousand, four hundred and sixty-three
Ordinaltwo million, three hundred and twenty-three thousand, four hundred and sixty-third
Scientific notation2.323463 × 10^6
Engineering notation2.323463 × 10^6
In other bases
Ternary11101001012012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1043322323base 5; one hand: 10 digits
Septenary25514642base 7: 8 digits
Nonary4331165base 9; each digit is two ternary digits: 7 digits
Duodecimal94071bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalea8d3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:45:24:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111010011TT1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001001011010000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000110111010000000111
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
Bytes323 74 07
Gray code1100101100111000000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000110111010000000111
64-bit0000000000000000000000000000000000000000001000110111010000000111
One's complement11111111110111001000101111111000at 32 bits, every bit flipped
Bits reversed11100000001011101100010000000000at 32 bits
Rotated left by 100000000010001101110100000001110at 32 bits, wrapping
Shifted left by 110001101110100000001110= 4,646,926, no wrap
Shifted right by 1100011011101000000011= 1,161,731, discarding the low bit
These bits as a double1.14794325 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,323,463 to the power 25,398,480,312,369
2,323,463 to the power 312,543,169,262,017,813,847
2,323,463 to the power 429,143,589,683,035,695,814,392,161
2,323,463 to the power 567,714,052,315,715,166,903,995,053,573,543
First ten multiples2,323,463, 4,646,926, 6,970,389, 9,293,852, 11,617,315, 13,940,778, 16,264,241, 18,587,704, 20,911,167, 23,234,630
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 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1254the total stopping time
Highest value reached29,038,98412× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,323,463 → 6,970,390 → 3,485,195 → 10,455,586 → 5,227,793 → 15,683,380 → 7,841,690 → 3,920,845 → 11,762,536 → 5,881,268 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage232,346,300%
2,323,463% as a decimal23,234.63
2,323,463% of 1002,323,463
2,323,463% of 1,00023,234,630
As a fraction of 1002,323,463/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,323,463
Nerdulate something else
Nothing in mind? Surprise me · today’s page