Recognised as Number
2,148,989
- Positive
- Odd
- Prime
- 7 digits
2,148,989 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,148,989
Digit count7
Digit sum41
Digit product41,472
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,148,989
Distinct prime factors12,148,989
Number of divisors2
Sum of divisors σ(n)2,148,990
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,148,988integers below n that share no factor with it
Carmichael function λ(n)2,148,988the 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,148,9892 in total
Arithmetic
Previous number2,148,988
Next number2,148,990
Double4,297,978
Half1,074,494.5
Square4,618,153,722,121
Cube9,924,361,549,147,085,669
Square root1,465.943041185≈irrational, shown to 9 decimal places
Cube root129.046054505≈
Negation-2,148,989
Reciprocal4.65335095 × 10^-7≈
Representations
Decimal2,148,989
Binary100000110010100111110122 bits
Octal10145175
Hexadecimal20CA7D
Base 361A265
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and forty-eight thousand, nine hundred and eighty-nine
Ordinaltwo million, one hundred and forty-eight thousand, nine hundred and eighty-ninth
Scientific notation2.148989 × 10^6
Engineering notation2.148989 × 10^6
In other bases
Ternary11001011212012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1022231424base 5; one hand: 10 digits
Septenary24160163base 7: 8 digits
Nonary4034765base 9; each digit is two ternary digits: 7 digits
Duodecimal877765base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald8c99base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:56:56:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110011TT0TT1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000011101111110001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000001100101001111101
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
Bytes320 ca 7d
Gray code1100001010111101000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000001100101001111101
64-bit0000000000000000000000000000000000000000001000001100101001111101
One's complement11111111110111110011010110000010at 32 bits, every bit flipped
Bits reversed10111110010100110000010000000000at 32 bits
Rotated left by 100000000010000011001010011111010at 32 bits, wrapping
Shifted left by 110000011001010011111010= 4,297,978, no wrap
Shifted right by 1100000110010100111110= 1,074,494, discarding the low bit
These bits as a double1.06174164 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,148,989 to the power 24,618,153,722,121
2,148,989 to the power 39,924,361,549,147,085,669
2,148,989 to the power 421,327,343,801,140,046,484,738,641
2,148,989 to the power 545,832,227,227,868,147,355,192,007,383,949
First ten multiples2,148,989, 4,297,978, 6,446,967, 8,595,956, 10,744,945, 12,893,934, 15,042,923, 17,191,912, 19,340,901, 21,489,890
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 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1166the total stopping time
Highest value reached17,426,5008× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,148,989 → 6,446,968 → 3,223,484 → 1,611,742 → 805,871 → 2,417,614 → 1,208,807 → 3,626,422 → 1,813,211 → 5,439,634 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage214,898,900%
2,148,989% as a decimal21,489.89
2,148,989% of 1002,148,989
2,148,989% of 1,00021,489,890
As a fraction of 1002,148,989/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,148,989
Nerdulate something else
Nothing in mind? Surprise me · today’s page