Recognised as Number
2,148,962
- Positive
- Even
- Composite
- 7 digits
2,148,962 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,148,962
Digit count7
Digit sum32
Digit product6,912
Multiplicative persistence3times 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 × 1,074,481
Distinct prime factors22, 1,074,481
Number of divisors4
Sum of divisors σ(n)3,223,446
Aliquot sum1,074,484sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,074,480integers below n that share no factor with it
Carmichael function λ(n)1,074,480the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 1,074,481, 2,148,9624 in total
Arithmetic
Previous number2,148,961
Next number2,148,963
Double4,297,924
Half1,074,481
Square4,618,037,677,444
Cube9,923,987,483,395,413,128
Square root1,465.933832067≈irrational, shown to 9 decimal places
Cube root129.045514056≈
Negation-2,148,962
Reciprocal4.65340941 × 10^-7≈
Representations
Decimal2,148,962
Binary100000110010100110001022 bits
Octal10145142
Hexadecimal20CA62
Base 361A25E
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and forty-eight thousand, nine hundred and sixty-two
Ordinaltwo million, one hundred and forty-eight thousand, nine hundred and sixty-second
Scientific notation2.148962 × 10^6
Engineering notation2.148962 × 10^6
In other bases
Ternary11001011211012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1022231322base 5; one hand: 10 digits
Septenary24160124base 7: 8 digits
Nonary4034735base 9; each digit is two ternary digits: 7 digits
Duodecimal877742base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald8c82base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:56:56:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110011TTT111TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000011101111110100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000001100101001100010
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes320 ca 62
Gray code1100001010111101010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000001100101001100010
64-bit0000000000000000000000000000000000000000001000001100101001100010
One's complement11111111110111110011010110011101at 32 bits, every bit flipped
Bits reversed01000110010100110000010000000000at 32 bits
Rotated left by 100000000010000011001010011000100at 32 bits, wrapping
Shifted left by 110000011001010011000100= 4,297,924, no wrap
Shifted right by 1100000110010100110001= 1,074,481, discarding the low bit
These bits as a double1.0617283 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,148,962 to the power 24,618,037,677,444
2,148,962 to the power 39,923,987,483,395,413,128
2,148,962 to the power 421,326,271,990,292,373,786,373,136
2,148,962 to the power 545,829,348,108,802,680,156,711,987,084,832
First ten multiples2,148,962, 4,297,924, 6,446,886, 8,595,848, 10,744,810, 12,893,772, 15,042,734, 17,191,696, 19,340,658, 21,489,620
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 4
Divisible by 8No, remainder 2
Divisible by 9No, remainder 5
Divisible by 10No, remainder 2
Divisible by 11No, remainder 2
Divisible by 12No, remainder 2
Divisible by 100No, remainder 62
Collatz (3n + 1) trajectory
Steps to reach 173the total stopping time
Highest value reached3,223,4441× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,148,962 → 1,074,481 → 3,223,444 → 1,611,722 → 805,861 → 2,417,584 → 1,208,792 → 604,396 → 302,198 → 151,099 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage214,896,200%
2,148,962% as a decimal21,489.62
2,148,962% of 1002,148,962
2,148,962% of 1,00021,489,620
As a fraction of 1002,148,962/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,962
Nerdulate something else
Nothing in mind? Surprise me · today’s page