Recognised as Number
2,370,601
- Positive
- Odd
- Composite
- 7 digits
2,370,601 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,370,601
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation31 × 76,471
Distinct prime factors231, 76,471
Number of divisors4
Sum of divisors σ(n)2,447,104
Aliquot sum76,503sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,294,100integers below n that share no factor with it
Carmichael function λ(n)76,470the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,294,100
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 31, 76,471, 2,370,6014 in total
Arithmetic
Previous number2,370,600
Next number2,370,602
Double4,741,202
Half1,185,300.5
Square5,619,749,101,201
Cube13,322,182,839,056,191,801
Square root1,539.675615187≈irrational, shown to 9 decimal places
Cube root133.337657499≈
Negation-2,370,601
Reciprocal4.21833957 × 10^-7≈
Representations
Decimal2,370,601
Binary100100001011000010100122 bits
Octal11026051
Hexadecimal242C29
Base 361ET61
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and seventy thousand, six hundred and one
Ordinaltwo million, three hundred and seventy thousand, six hundred and first
Scientific notation2.370601 × 10^6
Engineering notation2.370601 × 10^6
In other bases
Ternary11110102212001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1101324401base 5; one hand: 10 digits
Septenary26102242base 7: 8 digits
Nonary4412761base 9; each digit is two ternary digits: 7 digits
Duodecimal963a61base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaleg6a1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:58:30:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111101100TT001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001000111110001111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001000010110000101001
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 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 2c 29
Gray code1101100011101000111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001000010110000101001
64-bit0000000000000000000000000000000000000000001001000010110000101001
One's complement11111111110110111101001111010110at 32 bits, every bit flipped
Bits reversed10010100001101000010010000000000at 32 bits
Rotated left by 100000000010010000101100001010010at 32 bits, wrapping
Shifted left by 110010000101100001010010= 4,741,202, no wrap
Shifted right by 1100100001011000010100= 1,185,300, discarding the low bit
These bits as a double1.17123251 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,370,601 to the power 25,619,749,101,201
2,370,601 to the power 313,322,182,839,056,191,801
2,370,601 to the power 431,581,579,960,449,447,339,642,401
2,370,601 to the power 574,867,325,035,821,420,312,803,615,453,001
First ten multiples2,370,601, 4,741,202, 7,111,803, 9,482,404, 11,853,005, 14,223,606, 16,594,207, 18,964,808, 21,335,409, 23,706,010
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1161the total stopping time
Highest value reached27,002,64411× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,370,601 → 7,111,804 → 3,555,902 → 1,777,951 → 5,333,854 → 2,666,927 → 8,000,782 → 4,000,391 → 12,001,174 → 6,000,587 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage237,060,100%
2,370,601% as a decimal23,706.01
2,370,601% of 1002,370,601
2,370,601% of 1,00023,706,010
As a fraction of 1002,370,601/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,370,601
Nerdulate something else
Nothing in mind? Surprise me · today’s page