Recognised as Number
2,398,117
- Positive
- Odd
- Composite
- 7 digits
2,398,117 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,398,117
Digit count7
Digit sum31
Digit product3,024
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 factorisation347 × 6,911
Distinct prime factors2347, 6,911
Number of divisors4
Sum of divisors σ(n)2,405,376
Aliquot sum7,259sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,390,860integers below n that share no factor with it
Carmichael function λ(n)1,195,430the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,390,860
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 347, 6,911, 2,398,1174 in total
Arithmetic
Previous number2,398,116
Next number2,398,118
Double4,796,234
Half1,199,058.5
Square5,750,965,145,689
Cube13,791,487,282,284,267,613
Square root1,548.585483595≈irrational, shown to 9 decimal places
Cube root133.851565793≈
Negation-2,398,117
Reciprocal4.16993833 × 10^-7≈
Representations
Decimal2,398,117
Binary100100100101111010010122 bits
Octal11113645
Hexadecimal2497A5
Base 361FEED
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and ninety-eight thousand, one hundred and seventeen
Ordinaltwo million, three hundred and ninety-eight thousand, one hundred and seventeenth
Scientific notation2.398117 × 10^6
Engineering notation2.398117 × 10^6
In other bases
Ternary11111211121011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1103214432base 5; one hand: 10 digits
Septenary26245411base 7: 8 digits
Nonary4454534base 9; each digit is two ternary digits: 7 digits
Duodecimal977971base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalejf5hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:6:8:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTTT0TTTT1011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001011110100011100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001001001011110100101
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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 97 a5
Gray code1101101101110001110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001001001011110100101
64-bit0000000000000000000000000000000000000000001001001001011110100101
One's complement11111111110110110110100001011010at 32 bits, every bit flipped
Bits reversed10100101111010010010010000000000at 32 bits
Rotated left by 100000000010010010010111101001010at 32 bits, wrapping
Shifted left by 110010010010111101001010= 4,796,234, no wrap
Shifted right by 1100100100101111010010= 1,199,058, discarding the low bit
These bits as a double1.18482722 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,398,117 to the power 25,750,965,145,689
2,398,117 to the power 313,791,487,282,284,267,613
2,398,117 to the power 433,073,600,106,929,700,995,284,721
2,398,117 to the power 579,314,362,667,629,933,761,709,209,270,357
First ten multiples2,398,117, 4,796,234, 7,194,351, 9,592,468, 11,990,585, 14,388,702, 16,786,819, 19,184,936, 21,583,053, 23,981,170
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1223the total stopping time
Highest value reached24,948,16010× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,398,117 → 7,194,352 → 3,597,176 → 1,798,588 → 899,294 → 449,647 → 1,348,942 → 674,471 → 2,023,414 → 1,011,707 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage239,811,700%
2,398,117% as a decimal23,981.17
2,398,117% of 1002,398,117
2,398,117% of 1,00023,981,170
As a fraction of 1002,398,117/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,398,117
Nerdulate something else
Nothing in mind? Surprise me · today’s page