Recognised as Number
2,373,149
- Positive
- Odd
- Composite
- 7 digits
2,373,149 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,373,149
Digit count7
Digit sum29
Digit product4,536
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation17 × 139,597
Distinct prime factors217, 139,597
Number of divisors4
Sum of divisors σ(n)2,512,764
Aliquot sum139,615sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,233,536integers below n that share no factor with it
Carmichael function λ(n)558,384the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,233,536
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 139,597, 2,373,1494 in total
Arithmetic
Previous number2,373,148
Next number2,373,150
Double4,746,298
Half1,186,574.5
Square5,631,836,176,201
Cube13,365,186,389,715,226,949
Square root1,540.502839984≈irrational, shown to 9 decimal places
Cube root133.385412295≈
Negation-2,373,149
Reciprocal4.21381043 × 10^-7≈
Representations
Decimal2,373,149
Binary100100001101100001110122 bits
Octal11033035
Hexadecimal24361D
Base 361EV4T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and seventy-three thousand, one hundred and forty-nine
Ordinaltwo million, three hundred and seventy-three thousand, one hundred and forty-ninth
Scientific notation2.373149 × 10^6
Engineering notation2.373149 × 10^6
In other bases
Ternary11110120100102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1101420044base 5; one hand: 10 digits
Septenary26112542base 7: 8 digits
Nonary4416312base 9; each digit is two ternary digits: 7 digits
Duodecimal965425base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalegch9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:59:12:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11111TT010011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001000100101001101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001000011011000011101
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 36 1d
Gray code1101100010110100010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001000011011000011101
64-bit0000000000000000000000000000000000000000001001000011011000011101
One's complement11111111110110111100100111100010at 32 bits, every bit flipped
Bits reversed10111000011011000010010000000000at 32 bits
Rotated left by 100000000010010000110110000111010at 32 bits, wrapping
Shifted left by 110010000110110000111010= 4,746,298, no wrap
Shifted right by 1100100001101100001110= 1,186,574, discarding the low bit
These bits as a double1.17249139 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,373,149 to the power 25,631,836,176,201
2,373,149 to the power 313,365,186,389,715,226,949
2,373,149 to the power 431,717,578,715,566,301,118,792,401
2,373,149 to the power 575,270,540,211,267,451,933,761,067,640,749
First ten multiples2,373,149, 4,746,298, 7,119,447, 9,492,596, 11,865,745, 14,238,894, 16,612,043, 18,985,192, 21,358,341, 23,731,490
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1161the total stopping time
Highest value reached7,119,4483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,373,149 → 7,119,448 → 3,559,724 → 1,779,862 → 889,931 → 2,669,794 → 1,334,897 → 4,004,692 → 2,002,346 → 1,001,173 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage237,314,900%
2,373,149% as a decimal23,731.49
2,373,149% of 1002,373,149
2,373,149% of 1,00023,731,490
As a fraction of 1002,373,149/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,373,149
Nerdulate something else
Nothing in mind? Surprise me · today’s page