Recognised as Number
2,393,473
- Positive
- Odd
- Prime
- 7 digits
2,393,473 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,393,473
Digit count7
Digit sum31
Digit product13,608
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,393,473
Distinct prime factors12,393,473
Number of divisors2
Sum of divisors σ(n)2,393,474
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,393,472integers below n that share no factor with it
Carmichael function λ(n)2,393,472the 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,393,4732 in total
Arithmetic
Previous number2,393,472
Next number2,393,474
Double4,786,946
Half1,196,736.5
Square5,728,713,001,729
Cube13,711,519,894,387,314,817
Square root1,547.085324085≈irrational, shown to 9 decimal places
Cube root133.76510791≈
Negation-2,393,473
Reciprocal4.17802917 × 10^-7≈
Representations
Decimal2,393,473
Binary100100100001011000000122 bits
Octal11102601
Hexadecimal248581
Base 361FATD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and ninety-three thousand, four hundred and seventy-three
Ordinaltwo million, three hundred and ninety-three thousand, four hundred and seventy-third
Scientific notation2.393473 × 10^6
Engineering notation2.393473 × 10^6
In other bases
Ternary11111121020011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1103042343base 5; one hand: 10 digits
Septenary26226025base 7: 8 digits
Nonary4447204base 9; each digit is two ternary digits: 7 digits
Duodecimal975141base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalej3ddbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:4:51:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTTTTT11T0011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001011001101010000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001001000010110000001
Bit length22 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits15within that length
Bit parityodd7 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
Bytes324 85 81
Gray code1101101100011101000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001001000010110000001
64-bit0000000000000000000000000000000000000000001001001000010110000001
One's complement11111111110110110111101001111110at 32 bits, every bit flipped
Bits reversed10000001101000010010010000000000at 32 bits
Rotated left by 100000000010010010000101100000010at 32 bits, wrapping
Shifted left by 110010010000101100000010= 4,786,946, no wrap
Shifted right by 1100100100001011000000= 1,196,736, discarding the low bit
These bits as a double1.18253278 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,393,473 to the power 25,728,713,001,729
2,393,473 to the power 313,711,519,894,387,314,817
2,393,473 to the power 432,818,152,656,178,889,556,989,441
2,393,473 to the power 578,549,362,292,442,455,324,636,188,318,593
First ten multiples2,393,473, 4,786,946, 7,180,419, 9,573,892, 11,967,365, 14,360,838, 16,754,311, 19,147,784, 21,541,257, 23,934,730
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1329the total stopping time
Highest value reached7,180,4203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,393,473 → 7,180,420 → 3,590,210 → 1,795,105 → 5,385,316 → 2,692,658 → 1,346,329 → 4,038,988 → 2,019,494 → 1,009,747 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage239,347,300%
2,393,473% as a decimal23,934.73
2,393,473% of 1002,393,473
2,393,473% of 1,00023,934,730
As a fraction of 1002,393,473/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,393,473
Nerdulate something else
Nothing in mind? Surprise me · today’s page