Nerdulator> put something in

Recognised as Number

2,201,493

  • Positive
  • Odd
  • Composite
  • 7 digits

2,201,493 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,201,493
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7 × 79 × 1,327
Distinct prime factors43, 7, 79, 1,327
Number of divisors16
Sum of divisors σ(n)3,399,680
Aliquot sum1,198,187sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,241,136integers below n that share no factor with it
Carmichael function λ(n)1,326the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,241,136
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 79, 237, 553, 1,327, 1,659, 3,981, 9,289, 27,867, 104,833, 314,499, 733,831, 2,201,49316 in total

Arithmetic

Previous number2,201,492
Next number2,201,494
Double4,402,986
Cube10,669,693,075,051,370,157
Square root1,483.742902258≈irrational, shown to 9 decimal places
Cube root130.088558987≈
Negation-2,201,493
Reciprocal4.54237193 × 10^-7≈

Representations

Decimal2,201,493
Binary100001100101111001010122 bits
Octal10313625
Hexadecimal219795
Base 361B6OL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and one thousand, four hundred and ninety-three
Ordinaltwo million, two hundred and one thousand, four hundred and ninety-third
Scientific notation2.201493 × 10^6
Engineering notation2.201493 × 10^6

In other bases

Ternary11010211212210base 3; the most digit-efficient integer base after e: 14 digits
Quinary1030421433base 5; one hand: 10 digits
Septenary24466230base 7: 8 digits
Nonary4124783base 9; each digit is two ternary digits: 7 digits
Duodecimal8a2019base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldf3edbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:11:31:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110110TT0T0T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101110100010010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001000011001011110010101
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
Bytes321 97 95
Gray code1100010101110001011111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001000011001011110010101
64-bit0000000000000000000000000000000000000000001000011001011110010101
One's complement11111111110111100110100001101010at 32 bits, every bit flipped
Bits reversed10101001111010011000010000000000at 32 bits
Rotated left by 100000000010000110010111100101010at 32 bits, wrapping
Shifted left by 110000110010111100101010= 4,402,986, no wrap
Shifted right by 1100001100101111001010= 1,100,746, discarding the low bit
These bits as a double1.08768206 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,201,501+8
Previous prime2,201,489−4
Distance to nearest prime4
Nearest square below2,199,289
Nearest square above2,202,256

Powers & multiples

2,201,493 to the power 24,846,571,429,049
2,201,493 to the power 310,669,693,075,051,370,157
2,201,493 to the power 423,489,254,616,874,066,041,044,401
2,201,493 to the power 551,711,429,614,265,938,270,896,961,490,693
First ten multiples2,201,493, 4,402,986, 6,604,479, 8,805,972, 11,007,465, 13,208,958, 15,410,451, 17,611,944, 19,813,437, 22,014,930
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 93

Collatz (3n + 1) trajectory

Steps to reach 1166the total stopping time
Highest value reached6,604,4803× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,201,493 → 6,604,480 → 3,302,240 → 1,651,120 → 825,560 → 412,780 → 206,390 → 103,195 → 309,586 → 154,793 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage220,149,300%
2,201,493% as a decimal22,014.93
2,201,493% of 1002,201,493
2,201,493% of 1,00022,014,930
As a fraction of 1002,201,493/100

Read another way

As bytes2.1 MiB
As a 24-bit colour#219795

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 “2201493” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.