Nerdulator> put something in

Recognised as Number

2,100,533

  • Positive
  • Odd
  • Prime
  • 7 digits

2,100,533 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,100,533
Digit count7
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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,100,533
Distinct prime factors12,100,533
Number of divisors2
Sum of divisors σ(n)2,100,534
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,100,532integers below n that share no factor with it
Carmichael function λ(n)2,100,532the 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,100,5332 in total

Arithmetic

Previous number2,100,532
Next number2,100,534
Double4,201,066
Cube9,268,053,379,912,119,437
Square root1,449.321565423≈irrational, shown to 9 decimal places
Cube root128.068749689≈
Negation-2,100,533
Reciprocal4.76069645 × 10^-7≈

Representations

Decimal2,100,533
Binary100000000011010011010122 bits
Octal10006465
Hexadecimal200D35
Base 36190S5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred thousand, five hundred and thirty-three
Ordinaltwo million, one hundred thousand, five hundred and thirty-third
Scientific notation2.100533 × 10^6
Engineering notation2.100533 × 10^6

In other bases

Ternary10221201101112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1014204113base 5; one hand: 10 digits
Septenary23566001base 7: 8 digits
Nonary3851345base 9; each digit is two ternary digits: 7 digits
Duodecimal853705base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald2b6dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:43:28:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1100TT0111TTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000001110101110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001000000000110100110101
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
Bytes320 0d 35
Gray code1100000000101110101111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001000000000110100110101
64-bit0000000000000000000000000000000000000000001000000000110100110101
One's complement11111111110111111111001011001010at 32 bits, every bit flipped
Bits reversed10101100101100000000010000000000at 32 bits
Rotated left by 100000000010000000001101001101010at 32 bits, wrapping
Shifted left by 110000000001101001101010= 4,201,066, no wrap
Shifted right by 1100000000011010011010= 1,050,266, discarding the low bit
These bits as a double1.03780119 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,100,541+8
Previous prime2,100,523−10
Distance to nearest prime0, it is prime
Nearest square below2,099,601
Nearest square above2,102,500

Powers & multiples

2,100,533 to the power 24,412,238,884,089
2,100,533 to the power 39,268,053,379,912,119,437
2,100,533 to the power 419,467,851,970,266,943,977,359,921
2,100,533 to the power 540,892,865,502,660,734,633,595,766,937,893
First ten multiples2,100,533, 4,201,066, 6,301,599, 8,402,132, 10,502,665, 12,603,198, 14,703,731, 16,804,264, 18,904,797, 21,005,330
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1104the total stopping time
Highest value reached6,301,6003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,100,533 → 6,301,600 → 3,150,800 → 1,575,400 → 787,700 → 393,850 → 196,925 → 590,776 → 295,388 → 147,694 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage210,053,300%
2,100,533% as a decimal21,005.33
2,100,533% of 1002,100,533
2,100,533% of 1,00021,005,330
As a fraction of 1002,100,533/100

Read another way

As bytes2.003 MiB
As a 24-bit colour#200D35

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “2100533” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.