Recognised as Number
2,397,075
- Positive
- Odd
- Composite
- 7 digits
2,397,075 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,397,075
Digit count7
Digit sum33
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 5^2 × 31 × 1,031
Distinct prime factors43, 5, 31, 1,031
Number of divisors24
Sum of divisors σ(n)4,094,976
Aliquot sum1,697,901sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,236,000integers below n that share no factor with it
Carmichael function λ(n)6,180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,236,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 15, 25, 31, 75, 93, 155, 465, 775, 1,031, 2,325, 3,093, 5,155, 15,465, 25,775, 31,961, 77,325, 95,883, 159,805, 479,415, 799,025, 2,397,07524 in total
Arithmetic
Previous number2,397,074
Next number2,397,076
Double4,794,150
Half1,198,537.5
Square5,745,968,555,625
Cube13,773,517,575,474,796,875
Square root1,548.24901098≈irrational, shown to 9 decimal places
Cube root133.832176478≈
Negation-2,397,075
Reciprocal4.17175099 × 10^-7≈
Representations
Decimal2,397,075
Binary100100100100111001001122 bits
Octal11111623
Hexadecimal249393
Base 361FDLF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and ninety-seven thousand and seventy-five
Ordinaltwo million, three hundred and ninety-seven thousand and seventy-fifth
Scientific notation2.397075 × 10^6
Engineering notation2.397075 × 10^6
In other bases
Ternary11111210011120base 3; the most digit-efficient integer base after e: 14 digits
Quinary1103201300base 5; one hand: 10 digits
Septenary26242362base 7: 8 digits
Nonary4453146base 9; each digit is two ternary digits: 7 digits
Duodecimal977243base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalejcdfbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:5:51:15base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTTTT101TTTT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001011001010010010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001001001001110010011
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 93 93
Gray code1101101101101001011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001001001001110010011
64-bit0000000000000000000000000000000000000000001001001001001110010011
One's complement11111111110110110110110001101100at 32 bits, every bit flipped
Bits reversed11001001110010010010010000000000at 32 bits
Rotated left by 100000000010010010010011100100110at 32 bits, wrapping
Shifted left by 110010010010011100100110= 4,794,150, no wrap
Shifted right by 1100100100100111001001= 1,198,537, discarding the low bit
These bits as a double1.18431241 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,397,075 to the power 25,745,968,555,625
2,397,075 to the power 313,773,517,575,474,796,875
2,397,075 to the power 433,016,154,642,231,248,719,140,625
2,397,075 to the power 579,142,198,889,026,470,523,434,013,671,875
First ten multiples2,397,075, 4,794,150, 7,191,225, 9,588,300, 11,985,375, 14,382,450, 16,779,525, 19,176,600, 21,573,675, 23,970,750
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 5
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 75
Collatz (3n + 1) trajectory
Steps to reach 1223the total stopping time
Highest value reached10,786,8404× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,397,075 → 7,191,226 → 3,595,613 → 10,786,840 → 5,393,420 → 2,696,710 → 1,348,355 → 4,045,066 → 2,022,533 → 6,067,600 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage239,707,500%
2,397,075% as a decimal23,970.75
2,397,075% of 1002,397,075
2,397,075% of 1,00023,970,750
As a fraction of 1002,397,075/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,397,075
Nerdulate something else
Nothing in mind? Surprise me · today’s page